Minimizing makespan in an ordered flow shop with machine-dependent processing times

DOI10.1007/s10878-010-9330-xzbMath1236.90050MaRDI QIDQ411247

Joseph Y.-T. Leung, Byung-Cheon Choi, Michael L. Pinedo

Publication date: 4 April 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9330-x

zbMATH Keywords

computational complexity; makespan; machine-dependent processing times; proportionate flow shop

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

Related Items

Two-machine flow shop scheduling problem with an outsourcing option, Predictive-reactive scheduling for single surgical suite subject to random emergency surgery, OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES

Cites Work

• Unnamed Item
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
• Time-dependent scheduling
• A note on the proportionate flow shop with a bottleneck machine
• Minimizing total weighted completion time in a proportionate flow shop
• The three-machine proportionate flow shop problem with unequal machine speeds
• A survey of scheduling with controllable processing times
• A state-of-the-art review on scheduling with learning effects
• An efficient algorithm for determining the convex hull of a finite planar set
• Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
• Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
• Faster algorithms for the shortest path problem
• Focused Scheduling in Proportionate Flowshops
• Ordered Flow Shop Problems with no In-Process Waiting: Further Results
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Flowshop sequencing problem with ordered processing time matrices: A general case
• The Complexity of Flowshop and Jobshop Scheduling
• Flowshop-scheduling problems with makespan criterion: a review