Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
From MaRDI portal
Publication:1715728
DOI10.1007/s40314-018-0694-3zbMath1413.90104OpenAlexW2890204778MaRDI QIDQ1715728
Muberra Allahverdi, Ali Allahverdi
Publication date: 29 January 2019
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-018-0694-3
Related Items (6)
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 ⋮ A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure ⋮ Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times ⋮ No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan ⋮ No-wait two-stage flowshop problem with multi-task flexibility of the first machine
Cites Work
- The third comprehensive survey on scheduling problems with setup times/costs
- 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
- On the minimization of the weighted number of tardy jobs with random processing times and deadline
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Optimal makespan scheduling with given bounds of processing times
- Total flowtime in no-wait flowshops with separated setup times.
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
- A survey of scheduling problems with no-wait in process
- Order scheduling with tardiness objective: improved approximate solutions
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
- Schedule execution for two-machine flow-shop with interval processing times
- Uncertainty measure for the Bellman-Johnson problem with interval processing times
- 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
- Scheduling Aircraft to Reduce Controller Workload
- The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
- Sequencing with uncertain numerical data for makespan minimisation
- Makespan-related criteria for comparing schedules in stochastic environments
- TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES
- Stochastic Scheduling with Release Dates and Due Dates
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Scheduling patients in an ambulatory surgical center
- Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
- Stability of Johnson's schedule with respect to limited machine availability
- Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
This page was built for publication: Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
