A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
type: Item
instance of: scholarly article
title: A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
zbMATH Open document ID: 1476.90140
author: Muberra Allahverdi
author: Harun Aydilek
author: Asiye Aydilek
author: Ali Allahverdi
published in: Journal of Industrial and Management Optimization
publication date: 2021-09-10T00:00:00Z
Mathematics Subject Classification ID: 90B36
zbMATH DE Number: 7394173
zbMATH Keywords: flowshop
zbMATH Keywords: scheduling-no-wait-two-machine-maxium
zbMATH Keywords: lateness-uncertain setup times
MaRDI profile type: Publication
full work available at URL: jimo.2020054
OpenAlex ID: W3010713473
cites work: A survey of scheduling problems with no-wait in process
cites work: The third comprehensive survey on scheduling problems with setup times/costs
cites work: Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
cites work: Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
cites work: Stability of Johnson's schedule with respect to limited machine availability
cites work: Generating Experimental Data for Computational Testing with Machine Scheduling Applications
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: Scheduling patients in an ambulatory surgical center
cites work: A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
cites work: Scheduling aircraft to reduce controller workload
cites work: Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
cites work: The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
cites work: Minimizing total weighted flow time of a set of jobs with interval processing times
cites work: Minimizing total weighted flow time under uncertainty using dominance and a stability box
cites work: Uncertainty measure for the Bellman-Johnson problem with interval processing times
DOI: 10.3934/JIMO.2020054
description: scientific article; zbMATH DE number 7394173