Multipurpose machine scheduling with rejection and identical job processing times
From MaRDI portal
Publication:2018939
DOI10.1007/s10951-014-0386-9zbMath1310.90055OpenAlexW1965760907MaRDI QIDQ2018939
Dvir Shabtay, Daniel Oron, Shlomo Karhi
Publication date: 26 March 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-014-0386-9
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
Parallel machine scheduling with restricted job rejection ⋮ Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines ⋮ Flowshop scheduling with learning effect and job rejection ⋮ Single-machine scheduling with maintenance activities and rejection
Cites Work
- Unnamed Item
- Unnamed Item
- A survey on offline scheduling with rejection
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Parallel-machine scheduling with deteriorating jobs and rejection
- Approximation algorithms for scheduling unrelated parallel machines
- New algorithms for an ancient scheduling problem.
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- A Lagrangean relaxation method for the constrained assignment problem
- Complexity of scheduling problems with multi-purpose machines
- Preemptive scheduling with rejection
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique.
- A branch-and-bound algorithm for the singly constrained assignment problem
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Scheduling unit-length jobs with machine eligibility restrictions
- Approximation schemes for scheduling and covering on unrelated machines
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Parallel machine scheduling with nested processing set restrictions
- Multicriteria scheduling problems: a survey
- Scheduling parallel machines with inclusive processing set restrictions
- Scheduling with Rejection to Minimize the Makespan
- Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories
- Resource-Constrained Assignment Scheduling
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Task Scheduling on a Multiprocessor System with Independent Memories
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Techniques for scheduling with rejection
- Reducibility among Combinatorial Problems
- Parallel machine scheduling with job assignment restrictions
- Semi-matchings for bipartite graphs and load balancing
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- Theory and Applications of Models of Computation
- Algorithms and Data Structures
This page was built for publication: Multipurpose machine scheduling with rejection and identical job processing times
