Maximizing weighted number of just-in-time jobs on unrelated parallel machines

DOI10.1007/S10951-005-2863-7zbMath1123.90037OpenAlexW2008024785MaRDI QIDQ880513

Shao Chin Sung, Milan Vlach

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-005-2863-7

zbMATH Keywords

polynomial time algorithmunrelated parallel machinesNP-hardnessjust-in-time jobs

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (15)

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 weighted number of on-time jobs on parallel machines with bounded job-rejection ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ A note: maximizing the weighted number of just-in-time jobs for a given job sequence ⋮ 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 ⋮ No-Wait Scheduling for Locks ⋮ 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 ⋮ Parameterized complexity of machine scheduling: 15 open problems ⋮ Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores ⋮ Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review

Cites Work

• Unnamed Item
• Single machine scheduling to minimize the number of early and tardy jobs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

This page was built for publication: Maximizing weighted number of just-in-time jobs on unrelated parallel machines