Scheduling jobs with equal processing times subject to machine eligibility constraints
From MaRDI portal
Publication:633548
DOI10.1007/s10951-010-0190-0zbMath1208.90071OpenAlexW1963732002MaRDI QIDQ633548
Joseph Y.-T. Leung, Michael L. Pinedo, Kangbok Lee
Publication date: 1 April 2011
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-010-0190-0
competitive ratiomakespanparallel machine schedulingworst-case ratioeligibility constraintequal-processing-time jobsnested and inclusive eligible setsonline and offline scheduling
Related Items (21)
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ An exact algorithm for the preemptive single machine scheduling of equal-length jobs ⋮ Online scheduling on two parallel identical machines under a grade of service provision ⋮ Scheduling uniform machines with restricted assignment ⋮ Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines ⋮ Approximations for the two-machine cross-docking flow shop problem ⋮ The ``least flexible job first rule in scheduling and in queueing ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Fast approximation algorithms for uniform machine scheduling with processing set restrictions ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Online scheduling with equal processing times and machine eligibility constraints ⋮ Multipurpose machine scheduling with rejection and identical job processing times ⋮ Improved bounds for online scheduling with eligibility constraints ⋮ Ideal schedules in parallel machine settings ⋮ Faster Algorithms for Semi-Matching Problems ⋮ Scheduling equal length jobs with eligibility restrictions ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times ⋮ Heuristics for online scheduling on identical parallel machines with two GoS levels
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- On a parallel machine scheduling problem with equal processing times
- Complexity of scheduling problems with multi-purpose machines
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Parallel machine scheduling under a grade of service provision
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Scheduling unit-length jobs with machine eligibility restrictions
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Parallel machine scheduling with nested processing set restrictions
- On-Line Load Balancing in a Hierarchical Server Topology
- Scheduling parallel machines with inclusive processing set restrictions
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- `` Strong NP-Completeness Results
- The Competitiveness of On-Line Assignments
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions
- Parallel machine scheduling with job assignment restrictions
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: Scheduling jobs with equal processing times subject to machine eligibility constraints
