Two-machine open-shop scheduling with rejection to minimize the makespan

DOI10.1007/S00291-015-0409-8MaRDI QIDQ280183zbMATH OpenOpenAlexFDO

Authors Jinjiang Yuan, Li-Qi Zhang, Lingfa Lu

Publication date 4 May 2016

Published in OR Spectrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00291-015-0409-8

zbMATH Keywords

schedulingNP-hardopen shoprejection cost

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Two-machine flow-shop scheduling with rejection
• TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION
• New results on two-machine flow-shop scheduling with rejection
• Scheduling with release times and rejection on two parallel machines
• Single machine scheduling with rejection to minimize the weighted makespan

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A survey on offline scheduling with rejection
• Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
• Multiprocessor Scheduling with Rejection
• New results on two-machine flow-shop scheduling with rejection
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
• Open Shop Scheduling to Minimize Finish Time
• Preemptive multiprocessor scheduling with rejection
• Preemptive scheduling with rejection
• Revised delivery-time quotation in scheduling with tardiness penalties
• Single machine scheduling with release dates and rejection
• Techniques for scheduling with rejection
• Two-Machine Super-Shop Scheduling Problem
• Two-machine flow-shop scheduling with rejection
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Cited in

(8)

• Editorial ``Project management and scheduling
• New results on two-machine flow-shop scheduling with rejection
• Two-machine flow-shop scheduling with rejection
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Coordinated order scheduling and outsourcing on dedicated parallel machines
• TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION
• Fifty years of research in scheduling -- theory and applications
• Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop

This page was built for publication: Two-machine open-shop scheduling with rejection to minimize the makespan

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280183)