Heuristics for hybrid flow shops with controllable processing times and assignable due dates
type: Item
instance of: scholarly article
title: Heuristics for hybrid flow shops with controllable processing times and assignable due dates
zbMATH Open document ID: 0994.90114
DOI: 10.1016/S0305-0548(01)00040-5
author: Jatinder N. D. Gupta
author: Karin Krüger
author: Volker Lauff
author: Yuri N. Sotskov
author: Frank Werner
published in: Computers \& Operations Research
publication date: 2002-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1766557
Wikidata QID: Q57633939
MaRDI profile type: Publication
cites work: Q4247460
cites work: Multicriteria scheduling problems: a survey
cites work: Branch and bound algorithm for the flow shop with multiple processors
cites work: General flow-shop scheduling with resource constraints
cites work: Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations
cites work: Survey of scheduling research involving due date determination decisions
cites work: On the application of insertion techniques for job shop problems with setup times
cites work: Analytical determination of optimal TWK due-dates in a job shop
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: A Survey of Scheduling Rules
full work available at URL: s0305-0548(01)00040-5
OpenAlex ID: W2039740342
description: scientific article; zbMATH DE number 1766557