Scheduling on parallel identical machines with job-rejection and position-dependent processing times
From MaRDI portal
Publication:456108
DOI10.1016/j.ipl.2012.06.009zbMath1248.68116OpenAlexW2008931506MaRDI QIDQ456108
Publication date: 23 October 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.06.009
Related Items
A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times ⋮ Several flow shop scheduling problems with truncated position-based learning effect ⋮ Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection ⋮ Graph multi-coloring for a job scheduling application ⋮ Two parallel-machine scheduling problems with function constraint ⋮ Minmax scheduling problems with common due-date and completion time penalty ⋮ Approximation algorithms for precedence-constrained identical machine scheduling with rejection ⋮ Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions ⋮ Single-machine scheduling and due date assignment with rejection and position-dependent processing times ⋮ Minmax due-date assignment with a time window for acceptable lead-times ⋮ Research on permutation flow shop scheduling problems with general position-dependent learning effects ⋮ Scheduling with job-rejection and position-dependent processing times on proportionate flowshops ⋮ Solving multi-objective parallel machine scheduling problem by a modified NSGA-II ⋮ Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection ⋮ Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval
Cites Work
- Unnamed Item
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties
- Scheduling with job-dependent learning effects and multiple rate-modifying activities
- Parallel-machine scheduling with deteriorating jobs and rejection
- Scheduling linear deteriorating jobs with rejection on a single machine
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- Single-machine scheduling with learning considerations
- Preemptive scheduling with rejection
- Two-machine flow-shop scheduling with rejection
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- Scheduling Deteriorating Jobs on a Single Processor
- Parallel machine scheduling with a learning effect
- Techniques for scheduling with rejection
- Multiprocessor Scheduling with Rejection
- Algorithms and Data Structures