Two-machine open-shop scheduling with rejection to minimize the makespan
From MaRDI portal
Publication:280183
DOI10.1007/s00291-015-0409-8zbMath1339.90157OpenAlexW911467051MaRDI QIDQ280183
Jinjiang Yuan, Ling-Fa Lu, Li-Qi Zhang
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Editorial ``Project management and scheduling ⋮ Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan
Cites Work
- Unnamed Item
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
- New results on two-machine flow-shop scheduling with rejection
- A survey on offline scheduling with 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
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
- Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties
- Two-Machine Super-Shop Scheduling Problem
- Open Shop Scheduling to Minimize Finish Time
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Techniques for scheduling with rejection
- Multiprocessor Scheduling with Rejection
- Preemptive multiprocessor scheduling with rejection
This page was built for publication: Two-machine open-shop scheduling with rejection to minimize the makespan
