Proportionate Flow Shop Scheduling with Rejection
From MaRDI portal
Publication:5359056
DOI10.1142/S0217595917500154zbMath1377.90031OpenAlexW2727036158MaRDI QIDQ5359056
Ren-Xia Chen, Deliang Qian, Shi-Sheng Li
Publication date: 22 September 2017
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595917500154
Related Items (3)
Machine scheduling with job rejection and Dejong's learning effect ⋮ Regular scheduling measures on proportionate flowshop with job rejection ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey on offline scheduling with rejection
- Two-machine flow shop scheduling problem with an outsourcing option
- Single machine scheduling with release dates and rejection
- Minimizing total weighted completion time in a proportionate flow shop
- Preemptive scheduling with rejection
- Two-machine flow-shop scheduling with rejection
- Order acceptance and scheduling with machine availability constraints
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
- Review of the ordered and proportionate flow shop scheduling research
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- The Complexity of Flowshop and Jobshop Scheduling
- Techniques for scheduling with rejection
- Reducibility among Combinatorial Problems
- Algorithms and Data Structures
This page was built for publication: Proportionate Flow Shop Scheduling with Rejection