Two-machine flow shop scheduling with a common due date to maximize total early work
type: Item
instance of: scholarly article
title: Two-machine flow shop scheduling with a common due date to maximize total early work
zbMATH Open document ID: 1495.90067
author: Xin Chen
author: Qian Miao
author: Małgorzata Sterna
author: B. M. T. Lin
author: Jacek Blazewicz
published in: European Journal of Operational Research
publication date: 2022-03-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 7493194
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: flow shop scheduling
zbMATH Keywords: early and late work
zbMATH Keywords: dynamic programming
zbMATH Keywords: FPTAS
MaRDI profile type: Publication
full work available at URL: j.ejor.2021.07.055
OpenAlex ID: W3193438168
Wikidata QID: Q115198388
cites work: Q3680271
cites work: Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
cites work: Q2712360
cites work: Open shop scheduling problems with late work criteria.
cites work: KI 2005: Advances in Artificial Intelligence
cites work: The two-machine flow-shop problem with weighted late work criterion and common due date
cites work: Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
cites work: Semi-online scheduling on two identical machines with a common due date to maximize total early work
cites work: Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
cites work: Scheduling on parallel identical machines with late work criterion: offline and online cases
cites work: Two-machine flow-shop scheduling to minimize total late work: revisited
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: A common approximation framework for early work, late work, and resource leveling problems
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
cites work: Q4821818
cites work: Approximation algorithms for scheduling a single machine to minimize total late work
cites work: Single Machine Scheduling to Minimize Total Late Work
cites work: A survey on offline scheduling with rejection
cites work: Mirror scheduling problems with early work and late work criteria
cites work: Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
cites work: Two‐agent scheduling with linear resource‐dependent processing times
cites work: Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
cites work: An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines
cites work: Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
cites work: Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
DOI: 10.1016/J.EJOR.2021.07.055
description: scientific article; zbMATH DE number 7493194