As the resource constrained project scheduling problem (RCPSP) has a wide range of applications, its models, extensions and algorithms have been intensively studied [2]. As for objective functions, makespan minimization has commonly been used, while the importance of non-regular ones such as earliness-tardiness are also recognized. In this paper, we introduce a time-lag cost, which is charged a...

A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsibl...

The main objective of the working paper series of the IIMA is to help faculty members to test out their research findings at the pre-publication stage. Abstract We address the permutation flowshop scheduling problem with earliness and tardiness penalties (E/T) and common due date of jobs. Large number of process and discrete parts industries follow flowshop type of production process. There are...

Abstract: Research on due date oriented objectives in the parallel machine environment is at best scarce compared to objectives such as minimizing the makespan or the completion time related performance measures. Moreover, almost all existing work in this area is focused on the identical parallel machine environment. In this study, we leverage on our previous work on the single machine total we...

This paper investigates single-machine scheduling with a deteriorating maintenance activity, where the processing time of job depends on whether it is handled before or after activity. Under common and slack due date assignments, aim to find optimal schedule, position value (flow-allowance) so that linear weighted sum earliness, tardiness minimized, weights are location-dependent (position-depe...

This paper considers single machine due-window assignment scheduling problems with position-dependent weights. Under the learning and deterioration effects of jobs processing times, our goal is to minimize weighted sum earliness-tardiness, starting time due-window, size, where weights only depends on their position in a sequence (i.e., weights). common (CONW), slack (SLKW) different (DIFW) assi...

This paper concentrates on the minimization of total tardiness and earliness of orders in an integrated production and transportation scheduling problem in a two-stage supply chain. Moreover, several constraints are also considered, including time windows due dates, and suppliers and vehicles availability times. After presenting the mathematical model of the problem, a developed version of GA c...