No-wait or no-idle permutation flowshop scheduling with dominating machines

DOI10.1007/BF02936066zbMath1138.90400MaRDI QIDQ1767400

Ji-Bo Wang, Zun-Quan Xia

Publication date: 10 March 2005

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Minimizing the weighted number of tardy jobs on multiple machines: a review, Minimizing total completion time in a two-machine flow shop with deteriorating jobs, Flow shop scheduling jobs with position-dependent processing times, Solution algorithms for synchronous flow shop problems with two dominating machines, 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, MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem, Flow shop scheduling with effects of learning and deterioration, Single-machine scheduling problems with an aging effect, A survey of scheduling problems with no-wait in process, Makespan minimization in machine dominated flowshop, Complexity results for flow shop problems with synchronous movement, Some scheduling problems with time-dependent learning effect and deteriorating jobs, Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs, Model formulations for the machine scheduling problem with limited waiting time constraints, SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING

Cites Work

• Unnamed Item
• Flow-shops with a dominant machine
• Flowshop scheduling with dominant machines
• Nonpreemptive flowshop scheduling with machine dominance
• Optimal two- and three-stage production schedules with setup times included
• 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
• 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
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs