this paper considers the problem of scheduling hybrid flowshops with machine availability constraints (mac) to minimize makespan. the paper deals with a specific case of mac caused by preventive maintenance (pm) operations. contrary to previous papers considering fixed or/and conservative policies, we explore a case in which pm activities might be postponed or expedited while necessary. regardi...

in this paper, three-stage assembly flowshop scheduling is considered with respect to minimizing bi-objectives, namely mean flow time and mean tardiness. this problem is a model of production systems, which several production operations are done simultaneously and independently, and then produced components are collected and transferred to an assembly stage for the final operation. in this mode...

A single machine scheduling problem is described which covers earliness costs, tardiness costs and setup costs. Setups are needed whenever a switch is made to a job of another product family. All jobs within the same product family have the same processing time. Besides setup costs also setup times are involved. Idle time is allowed, preemption is not allowed. Both a mixed integer programming f...

This paper addresses the parallel machine scheduling problem with family dependent setup times and total weighted completion time minimization. In this problem, when two jobs j k are scheduled consecutively on same machine, a is performed between finishing of starting if only belong to different families. The strongly NP-hard commonly addressed in literature by heuristic approaches branch-and-b...