Two-stage flow shop scheduling with dedicated machines

2014/08/05 by Bertrand M.T. Lin
Engineering · #Scheduling and Optimization Algorithms #Assembly Line Balancing Optimization #Advanced Manufacturing and Logistics Optimization

paper · doi:10.1080/00207543.2014.944631

Abstract

This study is concerned with the manufacturing model that has a common machine at stage one and two parallel dedicated machines at stage two. All jobs need to be processed on the stage-one common machine. After the stage-one processing, the jobs of type 1 (type 2) will route to the first (second) dedicated machine at stage two. We first elaborate several published works on makespan minimisation which are not known to other streams of recent works. While the minimisation of maximum lateness is strongly NP-hard, we develop a linear-time algorithm to solve the case where two sequences of the two job types are given a priori.

Citations

• Sequencing a hybrid two-stage flowshop with dedicated machines
• Batch scheduling in differentiation flow shops for makespan minimisation
• A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines

Related

• A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines
• Batch scheduling in differentiation flow shops for makespan minimisation
• Revisiting Johnson's rule for minimizing makespan in the Two-Machine Flow Shop scheduling problem
• On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
• Flowshop Machine Scheduling: Markov Modeling, Optimal Schedules and Heuristics