Scheduling equal-length jobs on identical parallel machines
From MaRDI portal
Publication:1570817
DOI10.1016/S0166-218X(99)00238-3zbMath0971.90027OpenAlexW1972077325WikidataQ127124572 ScholiaQ127124572MaRDI QIDQ1570817
Publication date: 11 July 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00238-3
Related Items (38)
A metric for total tardiness minimization ⋮ Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine ⋮ Scheduling jobs with equal processing times and time windows on identical parallel machines ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ An exact algorithm for the preemptive single machine scheduling of equal-length jobs ⋮ An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness ⋮ Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine ⋮ On the Complexity of Speed Scaling ⋮ Primal-dual analysis for online interval scheduling problems ⋮ Aircraft landing problems with aircraft classes ⋮ Joint replenishment meets scheduling ⋮ Equitable scheduling on a single machine ⋮ On minimizing the weighted number of late jobs in unit execution time open-shops. ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Preemptive scheduling of equal-length jobs in polynomial time ⋮ Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods ⋮ Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates ⋮ Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs ⋮ Parallel machine problems with equal processing times: a survey ⋮ Scheduling two agents on uniform parallel machines with~makespan and cost functions ⋮ A note on scheduling multiprocessor tasks with identical processing times. ⋮ Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem ⋮ A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates ⋮ On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems ⋮ On single-machine scheduling without intermediate delays ⋮ Matching supply and demand in a sharing economy: classification, computational complexity, and application ⋮ Unnamed Item ⋮ Complexity results for flow-shop problems with a single server ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ A decomposition scheme for single stage scheduling problems ⋮ Single-machine scheduling with release times, deadlines, setup times, and rejection ⋮ Fast LP models and algorithms for identical jobs on uniform parallel machines ⋮ Metric approach for finding approximate solutions of scheduling problems ⋮ Two-agent scheduling on uniform parallel machines with min-max criteria ⋮ Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times ⋮ On a parallel machine scheduling problem with equal processing times ⋮ Complexity results for parallel machine problems with a single server
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Scheduling identical jobs on uniform parallel machines
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
This page was built for publication: Scheduling equal-length jobs on identical parallel machines
