Nonpreemptive flowshop scheduling with machine dominance

DOI10.1016/S0377-2217(01)00356-3zbMath1001.90032MaRDI QIDQ1604067

Ondřej Čepek, Milan Vlach, Masanori Okada

Publication date: 3 July 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

schedulingflowshopmachine dominance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time ⋮ Flow shop scheduling problems with decreasing linear deterioration under dominant machines ⋮ Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling ⋮ A note on flow shop scheduling problems with a learning effect on no-idle dominant machines ⋮ Flowshop scheduling problems with a position-dependent exponential learning effect ⋮ No-wait or no-idle permutation flowshop scheduling with dominating machines ⋮ Makespan minimization in machine dominated flowshop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Flow-shops with a dominant machine
• Flowshop scheduling with dominant machines
• Optimal two- and three-stage production schedules with setup times included
• Minimizing Total Tardiness on One Machine is NP-Hard
• Some new results in flow shop scheduling
• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Optimal schedules for special structure flowshops
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times

This page was built for publication: Nonpreemptive flowshop scheduling with machine dominance