A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
From MaRDI portal
Publication:2168763
DOI10.1007/s10878-022-00857-yzbMath1498.90093OpenAlexW4226306011MaRDI QIDQ2168763
Alexander Cai, Bing Su, An Zhang, Rylan Chin, Guo-Hui Lin, Wen-Chang Luo
Publication date: 26 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00857-y
Cites Work
- Unnamed Item
- Unnamed Item
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
- Rescheduling with new orders and general maximum allowable time disruptions
- Order acceptance/rejection policies in determining the sequence in mixed model assembly lines
- Rescheduling for machine disruption to minimize makespan and maximum lateness
- Scheduling linear deteriorating jobs with rejection on a single machine
- Single-machine scheduling under the job rejection constraint
- Rescheduling on a single machine with part-type dependent setup times and deadlines
- A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling
- Two-agent parallel-machine scheduling with rejection
- Bicriteria order acceptance and scheduling with consideration of fill rate
- Cost allocation in rescheduling with machine unavailable period
- Rescheduling problems with allowing for the unexpected new jobs arrival
- Rescheduling due to machine disruption to minimize the total weighted completion time
- Modelling generator maintenance scheduling costs in deregulated power markets
- Rescheduling for Multiple New Orders
- Rescheduling for Job Unavailability
- Rescheduling for New Orders
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time
This page was built for publication: A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling