Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines

DOI10.1007/S10951-009-0139-3MaRDI QIDQ600836zbMATH OpenOpenAlexFDO

Authors Dariusz Dereniowski, Wieslaw Kubiak

Publication date 3 November 2010

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-009-0139-3

zbMATH Keywords

just-in-time schedulingmakespan minimizationmulti-slot

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 2139462
• A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
• Just-in-time scheduling with controllable processing times on parallel machines
• The just-in-time scheduling problem in a flow-shop scheduling system
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

Cites work

• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• scientific article; zbMATH DE number 1128827 (Why is no real title available?)
• Bounds on Multiprocessing Timing Anomalies
• Fairness Measures for Resource Allocation
• Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
• On the \(k\)-coloring of intervals
• Optimal flows in networks with multiple sources and sinks
• Precoloring extension. I: Interval graphs
• Proportional optimization and fairness
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Simple algorithms for gilmore-gomory's traveling salesman and related problems

Cited in

(6)

• Routing equal-size messages on a slotted ring
• A study on the enhanced best performance algorithm for the just-in-time scheduling problem
• A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
• Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
• scientific article; zbMATH DE number 2139462 (Why is no real title available?)
• A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria

This page was built for publication: Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600836)