Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times

DOI10.15672/HUJMS.831074zbMATH Open1524.90128OpenAlexW4308432140MaRDI QIDQ6157771FDOQ6157771

Muberra Allahverdi

Publication date: 22 June 2023

Published in: Hacettepe Journal of Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15672/hujms.831074

zbMATH Keywords

statistical inferenceno-wait flowshoptotal completion timeuncertain setup timesmathematical dominance relation

Mathematics Subject Classification ID

Production models (90B30) Stochastic scheduling theory in operations research (90B36)

Cites Work

• A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
• Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
• Principles of Sequencing and Scheduling
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• The third comprehensive survey on scheduling problems with setup times/costs
• Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
• Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
• Stochastic Scheduling with Release Dates and Due Dates
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
• Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
• A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
• A survey of scheduling problems with no-wait in process
• An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects

Cited In (1)

• A new heuristic and dominance relations for no-wait flowshops with setups

This page was built for publication: Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times

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