A bicriteria approach to scheduling a single machine with job rejection and positional penalties
From MaRDI portal
Publication:437059
DOI10.1007/s10878-010-9350-6zbMath1244.90102OpenAlexW1986235050MaRDI QIDQ437059
Nufar Gaspar, Dvir Shabtay, Liron Yedidsion
Publication date: 17 July 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9350-6
bicriteria optimizationFPTAS\(\mathcal{NP}\)-hardpseudo-polynomial time algorithmpositional penaltiesscheduling with job rejection
Related Items (25)
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times ⋮ A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization ⋮ The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost ⋮ A general scheme for solving a large set of scheduling problems with rejection in FPT time ⋮ Single-machine batch scheduling problem with job rejection and resource dependent processing times ⋮ Parallel machine scheduling with restricted job rejection ⋮ Learning variable neighborhood search for a scheduling problem with time windows and rejections ⋮ Bicriteria order acceptance and scheduling with consideration of fill rate ⋮ A survey on offline scheduling with rejection ⋮ Penalty cost constrained identical parallel machine scheduling problem ⋮ Designs for Order-of-Addition Screening Experiments ⋮ Single-machine scheduling and due date assignment with rejection and position-dependent processing times ⋮ Scheduling on parallel identical machines with job-rejection and position-dependent processing times ⋮ Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost ⋮ Single-machine scheduling with maintenance activities and rejection ⋮ Single machine resource allocation scheduling problems with deterioration effect and general positional effect ⋮ Vector scheduling with rejection on a single machine ⋮ On the parameterized tractability of single machine scheduling with rejection ⋮ Two-machine flow-shop scheduling with rejection ⋮ Multipurpose machine scheduling with rejection and identical job processing times ⋮ Metaheuristics for a scheduling problem with rejection and tardiness penalties ⋮ Regular scheduling measures on proportionate flowshop with job rejection ⋮ Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects
Cites Work
- Unnamed Item
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- Scheduling linear deteriorating jobs with rejection on a single machine
- Bounded single-machine parallel-batch scheduling with release dates and rejection
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- Single machine scheduling with release dates and rejection
- Preemptive scheduling with rejection
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Scheduling with rejection and non-identical job arrivals
- Common due window size and location determination in a single machine scheduling problem
- Sequencing with Earliness and Tardiness Penalties: A Review
- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
- Scheduling with Rejection to Minimize the Makespan
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Minimizing Variation of Flow Time in Single Machine Systems
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Algorithms for Scheduling Independent Tasks
- Techniques for scheduling with rejection
- Single Machine Scheduling with Flow Allowances
- Theory and Applications of Models of Computation
- Algorithms and Data Structures
This page was built for publication: A bicriteria approach to scheduling a single machine with job rejection and positional penalties