Two-machine open-shop scheduling with rejection to minimize the makespan
From MaRDI portal
Publication:280183
DOI10.1007/S00291-015-0409-8zbMATH Open1339.90157OpenAlexW911467051MaRDI QIDQ280183FDOQ280183
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
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
- Techniques for scheduling with rejection
- Single machine scheduling with release dates and rejection
- A survey on offline scheduling with rejection
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- 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
- New results on two-machine flow-shop scheduling with rejection
- Revised delivery-time quotation in scheduling with tardiness penalties
- Two-Machine Super-Shop Scheduling Problem
- Open Shop Scheduling to Minimize Finish Time
- Multiprocessor Scheduling with Rejection
- Preemptive multiprocessor scheduling with rejection
Cited In (6)
- 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
- TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION
- 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)
