A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times

DOI10.1016/j.apm.2013.02.003zbMath1426.90114OpenAlexW1979667184MaRDI QIDQ1789013

Ali Allahverdi, Harun Aydilek

Publication date: 9 October 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2013.02.003

zbMATH Keywords

schedulingmakespanflowshopsetup timesrandom and bounded processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times ⋮ Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times ⋮ Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times ⋮ Two-stage assembly scheduling problem for minimizing total tardiness with setup times ⋮ A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production

Cites Work

• Minimizing total weighted completion time with uncertain data: a stability approach
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
• Minimizing total weighted flow time of a set of jobs with interval processing times
• A contribution to the stochastic flow shop scheduling problem.
• Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
• Schedule execution for two-machine flow-shop with interval processing times
• The significance of reducing setup times/setup costs
• A survey of scheduling problems with setup times or costs
• A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
• Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• Stochastic scheduling with optimal customer service
• Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
• Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
• AN EVOLUTIONARY ALGORITHM FOR PURE FUZZY FLOWSHOP SCHEDULING PROBLEMS

This page was built for publication: A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times