The two-machine flow-shop problem with weighted late work criterion and common due date
type: Item
instance of: scholarly article
title: The two-machine flow-shop problem with weighted late work criterion and common due date
zbMATH Open document ID: 1066.90023
author: Erwin Pesch
author: Małgorzata Sterna
author: Frank Werner
author: Jacek Blazewicz
published in: European Journal of Operational Research
publication date: 2005-04-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 2160296
zbMATH Keywords: Scheduling
zbMATH Keywords: Flow-shop
zbMATH Keywords: Late work criteria
zbMATH Keywords: NP-hardness
zbMATH Keywords: Dynamic programming
MaRDI profile type: Publication
Wikidata QID: Q57387790
full work available at URL: j.ejor.2004.04.011
OpenAlex ID: W2125021514
cites work: Q3680271
cites work: Q2735585
cites work: Minimizing mean weighted execution time loss on identical and uniform processors
cites work: Q2712360
cites work: Open shop scheduling problems with late work criteria.
cites work: Q4396949
cites work: Q4198056
cites work: Minimizing Maximum Weighted Error for Imprecise Computation Tasks
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Scheduling shops to minimize the weighted number of late jobs
cites work: Q5485395
cites work: Single Machine Scheduling to Minimize Total Late Work
cites work: Approximation algorithms for scheduling a single machine to minimize total late work
cites work: Algorithms for Scheduling Imprecise Computations with Timing Constraints
DOI: 10.1016/J.EJOR.2004.04.011
description: scientific article; zbMATH DE number 2160296