A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
From MaRDI portal
Publication:1983744
DOI10.3934/jimo.2020054zbMath1476.90140OpenAlexW3010713473MaRDI QIDQ1983744
Asiye Aydilek, Harun Aydilek, Ali Allahverdi, Muberra Allahverdi
Publication date: 10 September 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2020054
Related Items (1)
Cites Work
- The third comprehensive survey on scheduling problems with setup times/costs
- Minimizing total weighted flow time of a set of jobs with interval processing times
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
- A survey of scheduling problems with no-wait in process
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Uncertainty measure for the Bellman-Johnson problem with interval processing times
- Scheduling Aircraft to Reduce Controller Workload
- The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- 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
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
This page was built for publication: A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
