Two-machine flow shop scheduling with a common due date to maximize total early work
From MaRDI portal
Publication:2116855
Recommendations
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- The two-machine flow-shop problem with weighted late work criterion and common due date
- A parallel machine scheduling problem maximizing total weighted early work
- A note on a due-date assignment on a two-machine flow-shop
Cites work
- scientific article; zbMATH DE number 1594554 (Why is no real title available?)
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- A common approximation framework for early work, late work, and resource leveling problems
- A survey on offline scheduling with rejection
- An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines
- Approximation algorithms for scheduling a single machine to minimize total late work
- Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
- KI 2005: Advances in Artificial Intelligence
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
- Mirror scheduling problems with early work and late work criteria
- Open shop scheduling problems with late work criteria.
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- 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
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- Single Machine Scheduling to Minimize Total Late Work
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Two-machine flow-shop scheduling to minimize total late work: revisited
- Two‐agent scheduling with linear resource‐dependent processing times
Cited in
(8)- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- Improved approximation schemes for early work scheduling on identical parallel machines with a common due date
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Maximizing total early work in a distributed two‐machine flow‐shop
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- A note on multimachine scheduling with weighted early/late work criteria and common due date
- 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)
