Open shop scheduling problems with late work criteria.
From MaRDI portal
Publication:1421458
DOI10.1016/S0166-218X(03)00339-1zbMATH Open1043.90026OpenAlexW2118724997WikidataQ57387795 ScholiaQ57387795MaRDI QIDQ1421458FDOQ1421458
Authors: Jacek Blazewicz, Małgorzata Sterna, Frank Werner, Erwin Pesch 
Publication date: 26 January 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00339-1
Recommendations
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Title not available (Why is that?)
- Title not available (Why is that?)
- Open Shop Scheduling to Minimize Finish Time
- Complexity results for scheduling chains on a single machine
- Scheduling identical jobs on uniform parallel machines
- Scheduling shops to minimize the weighted number of late jobs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Single Machine Scheduling to Minimize Total Late Work
- Approximation algorithms for scheduling a single machine to minimize total late work
- Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
- Minimizing Maximum Lateness in a Two-Machine Open Shop
- Minimizing mean weighted execution time loss on identical and uniform processors
- Operations scheduling with applications in manufacturing and services. With 3.5 disk package
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- Minimizing Maximum Weighted Error for Imprecise Computation Tasks
- Title not available (Why is that?)
Cited In (22)
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- A common approximation framework for early work, late work, and resource leveling problems
- Two-machine flow shop scheduling with a common due date to maximize total early work
- Online early work scheduling on parallel machines
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
- 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
- Two-machine flow-shop scheduling to minimize total late work: revisited
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- A no-delay single machine scheduling problem to minimize total weighted early and late work
- A new particle swarm optimization for multi-objective open shop scheduling
- A note on the two machine job shop with the weighted late work criterion
- A two-agent single-machine scheduling problem with late work criteria
- Open shop scheduling with delays
- Minimizing total weighted late work in the resource-constrained project scheduling problem
- Single-machine preemptive scheduling with release dates involving the total weighted late work criterion
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- Two-machine open shop problem with controllable processing times
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Title not available (Why is that?)
This page was built for publication: Open shop scheduling problems with late work criteria.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1421458)
