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

DOI10.1016/J.AMC.2006.04.052zbMATH Open1116.90049OpenAlexW2045611123MaRDI QIDQ861201FDOQ861201

Authors: Ji-Bo Wang, Feng Shan, Bo Jiang, Liyan Wang 

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

Recommendations

• No-wait or no-idle permutation flowshop scheduling with dominating machines
• Flowshop scheduling with dominant machines
• Flow shop scheduling problems with decreasing linear deterioration under dominant machines
• Flow-shops with a dominant machine
• Scheduling deteriorating jobs with rejection on dominant machines

zbMATH Keywords

schedulingflow shoppolynomial time algorithmdiscounted total weighed completion time

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal two- and three-stage production schedules with set-up time included
• The Complexity of Flowshop and Jobshop Scheduling
• Title not available (Why is that?)
• Some new results in flow shop scheduling
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Flowshop scheduling with dominant machines
• No-wait or no-idle permutation flowshop scheduling with dominating machines
• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• Flow-shops with a dominant machine
• Nonpreemptive flowshop scheduling with machine dominance
• The Three-Machine No-Wait Flow Shop is NP-Complete

Cited In (9)

• Makespan minimization in machine dominated flowshop
• Optimal four-machine flow shop scheduling with dominance condition
• Reduction of permutation flowshop problems to single machine problems using machine dominance relations
• Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
• Flowshop scheduling with dominant machines
• No-wait or no-idle permutation flowshop scheduling with dominating machines
• A systematic literature review on no-idle flow shop scheduling problem
• A survey of scheduling problems with no-wait in process

This page was built for publication: Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861201)