New results on two-machine flow-shop scheduling with rejection

DOI10.1007/s10878-015-9836-3zbMath1343.90042MaRDI QIDQ281786

Li-Qi Zhang, Shi-Sheng Li, Ling-Fa Lu

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9836-3

zbMATH Keywords

scheduling; on-line algorithm; flow shop; NP-hard; rejection penalty

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

Related Items

Outsourcing and scheduling for a two-machine flow shop with release times, Two-machine open-shop scheduling with rejection to minimize the makespan, A constraint generation approach for two-machine shop problems with jobs selection, Single machine lot scheduling with optional job-rejection, A general scheme for solving a large set of scheduling problems with rejection in FPT time

Cites Work

• A survey on offline scheduling with rejection
• Two-machine flow shop scheduling problem with an outsourcing option
• 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 with machine cost and rejection
• Scheduling with rejection and non-identical job arrivals
• Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
• Optimal two- and three-stage production schedules with setup times included
• Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection
• Preemptive multiprocessor scheduling with rejection
• Unnamed Item
• Unnamed Item