A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
From MaRDI portal
Publication:2387307
DOI10.1016/J.COR.2004.05.011zbMATH Open1178.90139OpenAlexW2039865527MaRDI QIDQ2387307FDOQ2387307
Authors: Ondřej Čepek, S-C. Sung 
Publication date: 2 September 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.05.011
Recommendations
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
- A note: maximizing the weighted number of just-in-time jobs for a given job sequence
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
- A note on just-in-time scheduling on flow shop machines
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Single machine scheduling to minimize the number of early and tardy jobs
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- A note on the maximum number of on-time jobs on parallel identical machines.
Cited In (17)
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- The just-in-time scheduling problem in a flow-shop scheduling system
- On the parameterized complexity of interval scheduling with eligible machine sets
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- A just-in-time scheduling problem with two competing agents
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
- A note on the maximum number of on-time jobs on parallel identical machines.
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- On the parameterized tractability of the just-in-time flow-shop scheduling problem
- Just-in-time scheduling with controllable processing times on parallel machines
- Two-agent single-machine scheduling problem with just-in-time jobs
- Minimizing the weighted number of tardy jobs on multiple machines: a review
This page was built for publication: A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387307)
