Scheduling jobs with equal processing times subject to machine eligibility constraints
From MaRDI portal
Publication:633548
DOI10.1007/S10951-010-0190-0zbMATH Open1208.90071OpenAlexW1963732002MaRDI QIDQ633548FDOQ633548
Authors: Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo 
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
Recommendations
- Online scheduling with equal processing times and machine eligibility constraints
- Scheduling equal length jobs with eligibility restrictions
- Makespan minimization in online scheduling with machine eligibility
- Makespan minimization in online scheduling with machine eligibility
- Scheduling jobs with release and delivery times subject to nested eligibility constraints
competitive ratiomakespanparallel machine schedulingworst-case ratioeligibility constraintequal-processing-time jobsnested and inclusive eligible setsonline and offline scheduling
Cites Work
- Title not available (Why is that?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Scheduling unit-length jobs with machine eligibility restrictions
- The Competitiveness of On-Line Assignments
- Approximation algorithms for scheduling unrelated parallel machines
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- `` Strong NP-Completeness Results
- On a parallel machine scheduling problem with equal processing times
- Title not available (Why is that?)
- On-line load balancing in a hierarchical server topology
- Parallel machine scheduling with job assignment restrictions
- Parallel machine scheduling under a grade of service provision
- Scheduling parallel machines with inclusive processing set restrictions
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Parallel machine scheduling with nested processing set restrictions
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Complexity of scheduling problems with multi-purpose machines
Cited In (30)
- Makespan minimization in online scheduling with machine eligibility
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- Single machine scheduling with two competing agents and equal job processing times
- Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions
- Heuristics for online scheduling on identical parallel machines with two GoS levels
- Faster algorithms for semi-matching problems
- Time-of-use scheduling problem with equal-length jobs
- Improved bounds for online scheduling with eligibility constraints
- Approximations for the two-machine cross-docking flow shop problem
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
- Ideal schedules in parallel machine settings
- Online scheduling with equal processing times and machine eligibility constraints
- Online scheduling on two parallel identical machines under a grade of service provision
- The ``least flexible job first rule in scheduling and in queueing
- Scheduling uniform machines with restricted assignment
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
- Variants of Multi-resource Scheduling Problems with Equal Processing Times
- Scheduling unit-length jobs with machine eligibility restrictions
- An exact algorithm for the preemptive single machine scheduling of equal-length jobs
- Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
- Multipurpose machine scheduling with rejection and identical job processing times
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
- Makespan minimization in online scheduling with machine eligibility
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
- Parallel machine scheduling with machine and human eligibility restrictions
- Scheduling equal length jobs with eligibility restrictions
This page was built for publication: Scheduling jobs with equal processing times subject to machine eligibility constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633548)
