Two-machine flow shop scheduling with a common due date to maximize total early work

DOI10.1016/J.EJOR.2021.07.055zbMATH Open1495.90067OpenAlexW3193438168WikidataQ115198388 ScholiaQ115198388MaRDI QIDQ2116855FDOQ2116855

Qian Miao, Xin Chen, B. M. T. Lin, Jacek Blazewicz, Małgorzata Sterna

Publication date: 18 March 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.07.055

zbMATH Keywords

combinatorial optimizationdynamic programmingFPTASflow shop schedulingearly and late work

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal two- and three-stage production schedules with set-up time included
• A survey on offline scheduling with rejection
• Title not available (Why is that?)
• The two-machine flow-shop problem with weighted late work criterion and common due date
• Title not available (Why is that?)
• Single Machine Scheduling to Minimize Total Late Work
• Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
• Approximation algorithms for scheduling a single machine to minimize total late work
• Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
• Open shop scheduling problems with late work criteria.
• Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
• A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
• Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
• Semi-online scheduling on two identical machines with a common due date to maximize total early work
• KI 2005: Advances in Artificial Intelligence
• Two-machine flow-shop scheduling to minimize total late work: revisited
• An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines
• Title not available (Why is that?)
• Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
• Mirror scheduling problems with early work and late work criteria
• Two‐agent scheduling with linear resource‐dependent processing times
• A common approximation framework for early work, late work, and resource leveling problems
• Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work

Cited In (3)

• Maximizing total early work in a distributed two‐machine flow‐shop
• Exact approaches to late work scheduling on unrelated machines
• Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

This page was built for publication: Two-machine flow shop scheduling with a common due date to maximize total early work

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116855)