Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
From MaRDI portal
Publication:1025256
DOI10.1016/j.cor.2009.02.001zbMath1162.90449OpenAlexW1975855930MaRDI QIDQ1025256
Yuhang Tian, Cheng, T. C. Edwin, Bertrand M. T. Lin
Publication date: 18 June 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.02.001
Related Items (9)
Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time ⋮ Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines ⋮ A heuristic method for two-stage hybrid flow shop with dedicated machines ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ The optimal number of used machines in a two-stage flexible flowshop scheduling problem ⋮ Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type ⋮ Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection ⋮ A two-stage flow shop scheduling with a critical machine and batch availability ⋮ Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
Cites Work
- Unnamed Item
- Johnson's rule, composite jobs and the relocation problem
- The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
- Flowshop scheduling with dominant machines
- Two-stage flowshop scheduling with a common second-stage machine
- Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
- Flow shop and open shop scheduling with a critical machine and two operations per job
- Comments on Flow shop and open shop scheduling with a critical machine and two operations per job
- Optimal two- and three-stage production schedules with setup times included
- The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
- The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
- The Lessons of Flowshop Scheduling Research
- TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
- The open shop scheduling problem with a given sequence of jobs on one machine
- A note on parallel-machine scheduling with deteriorating jobs
- Multi-Machine Scheduling With Linear Deterioration
This page was built for publication: Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times