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

DOI10.1016/J.APM.2013.02.003MaRDI QIDQ1789013zbMATH OpenOpenAlexFDO

Authors Harun Aydilek, Ali Allahverdi

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

flowshopmakespanrandom and bounded processing timesschedulingsetup times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
• Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
• Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
• Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
• Heuristics for two-machine flowshop scheduling with setup times and an availability constraint

Cites work

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

Cited in

(9)

• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
• Branch-and-price approach for robust parallel machine scheduling with sequence-dependent 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
• Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
• Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times
• Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
• Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times

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

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