Single machine scheduling with rejection and generalized parameters
From MaRDI portal
Publication:2149874
DOI10.1007/978-3-030-92681-6_20OpenAlexW4206809593MaRDI QIDQ2149874
Xue Yu, Li-Qi Zhang, Ling-Fa Lu
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_20
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- A survey on offline scheduling with rejection
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
- In-house production and outsourcing under different discount schemes on the total outsourcing cost
- New approximation algorithms for machine scheduling with rejection on single and parallel machine
- Minimizing maximum delivery completion time for order scheduling with rejection
- Single machine scheduling with release dates and rejection
- On the complexity of generalized due date scheduling problems
- Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
- A note on the SPT heuristic for solving scheduling problems with generalized due dates
- Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
- On the parameterized tractability of single machine scheduling with rejection
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Minimizing total late work on a single machine with generalized due-dates
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
- Flowshop scheduling with learning effect and job rejection
- Single-machine scheduling with maintenance activities and rejection
- Two-agent single-machine scheduling with assignable due dates
- Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates
- Scheduling with partial rejection
- Minimizing Total Tardiness on One Machine is NP-Hard
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Multiprocessor Scheduling with Rejection
- Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
