The two-machine flow-shop problem with weighted late work criterion and common due date
From MaRDI portal
Publication:1772844
DOI10.1016/j.ejor.2004.04.011zbMath1066.90023OpenAlexW2125021514WikidataQ57387790 ScholiaQ57387790MaRDI QIDQ1772844
Frank Werner, Erwin Pesch, Małgorzata Sterna, Jacek Błażewicz
Publication date: 21 April 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.011
Related Items (20)
Semi-online scheduling on two identical machines with a common due date to maximize total early work ⋮ Two-machine flow-shop scheduling to minimize total late work: revisited ⋮ Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ A multi-objective particle swarm for a flow shop scheduling problem ⋮ Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ A note on the two machine job shop with the weighted late work criterion ⋮ Scheduling with competing agents, total late work and job rejection ⋮ A common approximation framework for early work, late work, and resource leveling problems ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Maximizing total early work in a distributed two‐machine flow‐shop ⋮ Exact approaches to late work scheduling on unrelated machines ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ Minimizing total weighted late work in the resource-constrained project scheduling problem ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date ⋮ Optimally rescheduling jobs with a last-in-first-out buffer ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works ⋮ Two-machine flow shop scheduling with a common due date to maximize total early work
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing mean weighted execution time loss on identical and uniform processors
- Approximation algorithms for scheduling a single machine to minimize total late work
- Open shop scheduling problems with late work criteria.
- Scheduling shops to minimize the weighted number of late jobs
- Optimal two- and three-stage production schedules with setup times included
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- Single Machine Scheduling to Minimize Total Late Work
- Minimizing Maximum Weighted Error for Imprecise Computation Tasks
This page was built for publication: The two-machine flow-shop problem with weighted late work criterion and common due date
