Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time

DOI10.1016/j.amc.2006.04.052zbMath1116.90049OpenAlexW2045611123MaRDI QIDQ861201

Li-Yan Wang, Bo Jiang, Ji-Bo Wang, Feng Shan

Publication date: 9 January 2007

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

Full work available at URL: https://doi.org/10.1016/j.amc.2006.04.052

zbMATH Keywords

schedulingpolynomial time algorithmflow shopdiscounted total weighed completion time

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Related Items

Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration ⋮ A systematic literature review on no-idle flow shop scheduling problem ⋮ A survey of scheduling problems with no-wait in process ⋮ Makespan minimization in machine dominated flowshop

Cites Work

• Unnamed Item
• Unnamed Item
• Flow-shops with a dominant machine
• Flowshop scheduling with dominant machines
• Nonpreemptive flowshop scheduling with machine dominance
• No-wait or no-idle permutation flowshop scheduling with dominating machines
• 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