Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
From MaRDI portal
Publication:3163137
DOI10.1080/00207540903321657zbMath1197.90189OpenAlexW2055423534MaRDI QIDQ3163137
Publication date: 25 October 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540903321657
Related Items (6)
Single machine scheduling problem with interval processing times to minimize mean weighted completion time ⋮ Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times ⋮ Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times ⋮ Flowshop scheduling problem with parallel semi-lines and final synchronization operation ⋮ A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times ⋮ Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
Cites Work
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
- Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
- Two-machine ordered flowshop scheduling under random breakdowns
- 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
- 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
- Johnson's problem with stochastic processing times and optimal service level
- Optimal two- and three-stage production schedules with setup times included
- Sequencing with uncertain numerical data for makespan minimisation
- An integrated production and maintenance model for one failure prone machine-finite capacity buffer system for perishable products with constant demand
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
- Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup 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: Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
