Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
From MaRDI portal
Publication:600836
DOI10.1007/s10951-009-0139-3zbMath1200.90071MaRDI QIDQ600836
Dariusz Dereniowski, Wiesław X. 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
90B35: Deterministic scheduling theory in operations research
Related Items
A study on the enhanced best performance algorithm for the just-in-time scheduling problem, A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria, Routing equal-size messages on a slotted ring
Cites Work
- Unnamed Item
- Unnamed Item
- Proportional optimization and fairness
- Precoloring extension. I: Interval graphs
- On the \(k\)-coloring of intervals
- Simple algorithms for gilmore-gomory's traveling salesman and related problems
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Fairness Measures for Resource Allocation
- Optimal flows in networks with multiple sources and sinks
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Bounds on Multiprocessing Timing Anomalies
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs