TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION

DOI10.1142/S021759591450002XzbMath1302.90079OpenAlexW2041010530MaRDI QIDQ5411726

Qiang Gao, Xi-wen Lu

Publication date: 25 April 2014

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021759591450002x

zbMATH Keywords

FPTASrejectionflow shop schedulingoperation's penalty

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

An improved algorithm for a two-stage production scheduling problem with an outsourcing option

Cites Work

• Two-machine flow shop scheduling problem with an outsourcing option
• Online scheduling with rejection and withdrawal
• Parallel-machine scheduling with deteriorating jobs and rejection
• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
• 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
• Single machine scheduling with release dates and rejection
• 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
• Two-stage production scheduling with an outsourcing option
• Faster algorithms for the shortest path problem
• Multiprocessor Scheduling with Rejection
• Preemptive multiprocessor scheduling with rejection

This page was built for publication: TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION