A note on the two machine job shop with the weighted late work criterion
From MaRDI portal
Publication:880589
DOI10.1007/s10951-006-0005-5zbMath1154.90417OpenAlexW2119760838WikidataQ57387751 ScholiaQ57387751MaRDI QIDQ880589
Małgorzata Sterna, Erwin Pesch, Frank Werner, Jacek Błażewicz
Publication date: 15 May 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-006-0005-5
Related Items
Semi-online scheduling on two identical machines with a common due date to maximize total early work, Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays, Two-machine flow-shop scheduling to minimize total late work: revisited, Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs, Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work, Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers, A common approximation framework for early work, late work, and resource leveling problems, 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 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing mean weighted execution time loss on identical and uniform processors
- Open shop scheduling problems with late work criteria.
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Scheduling shops to minimize the weighted number of late jobs
- Optimal two- and three-stage production schedules with setup times included
- Single Machine Scheduling to Minimize Total Late Work