Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
type: Item
instance of: scholarly article
title: Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
zbMATH Open document ID: 1201.90070
author: Ali Allahverdi
author: Harun Aydilek
publication date: 2010-12-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5826514
zbMATH Keywords: scheduling
zbMATH Keywords: flowshop
zbMATH Keywords: maximum lateness
zbMATH Keywords: random processing times
MaRDI profile type: Publication
full work available at URL: j.camwa.2010.06.019
OpenAlex ID: W2081821125
cites work: Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
cites work: Schedule execution for two-machine flow-shop with interval processing times
cites work: Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
cites work: Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
cites work: Flowshop scheduling problem to minimize total completion time with random and bounded processing times
cites work: Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
cites work: Q4055377
cites work: A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
cites work: A survey of scheduling problems with setup times or costs
cites work: Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times
DOI: 10.1016/J.CAMWA.2010.06.019
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 5826514