Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
From MaRDI portal
Publication:600836
DOI10.1007/S10951-009-0139-3zbMATH Open1200.90071OpenAlexW2136004943MaRDI QIDQ600836FDOQ600836
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
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
- On the \(k\)-coloring of intervals
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Bounds on Multiprocessing Timing Anomalies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Proportional optimization and fairness
- Simple algorithms for gilmore-gomory's traveling salesman and related problems
- Precoloring extension. I: Interval graphs
- Fairness Measures for Resource Allocation
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- Optimal flows in networks with multiple sources and sinks
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
- Title not available (Why is that?)
- 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)
