Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
From MaRDI portal
Publication:980257
DOI10.1016/j.camwa.2009.10.025zbMath1189.90071OpenAlexW2049751087MaRDI QIDQ980257
Publication date: 28 June 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.10.025
Abstract computational complexity for mathematical programming problems (90C60) Stochastic scheduling theory in operations research (90B36)
Related Items
Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints ⋮ 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
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
- Optimal makespan scheduling with given bounds of processing times
- 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
- Sequencing with uncertain numerical data for makespan minimisation
- Makespan-related criteria for comparing schedules in stochastic environments
- 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
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Stochastic scheduling with optimal customer service
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times
- 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
