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.011zbMath1178.90139OpenAlexW2039865527MaRDI QIDQ2387307
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
Related Items (12)
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Maximizing the weighted number of just-in-time jobs in flow shop scheduling ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ The just-in-time scheduling problem in a flow-shop scheduling system ⋮ Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems ⋮ A just-in-time scheduling problem with two competing agents ⋮ Two-agent single-machine scheduling problem with just-in-time jobs ⋮ Just-in-time scheduling with controllable processing times on parallel machines ⋮ On the parameterized tractability of the just-in-time flow-shop scheduling problem
Cites Work
This page was built for publication: A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines