Proportionate flow shop scheduling with rejection
From MaRDI portal
Recommendations
- Regular scheduling measures on proportionate flowshop with job rejection
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
- TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
- Flowshop scheduling with learning effect and job rejection
Cites work
- A survey on offline scheduling with rejection
- Algorithms and Data Structures
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 871904 (Why is no real title available?)
- Minimizing total weighted completion time in a proportionate flow shop
- Order acceptance and scheduling with machine availability constraints
- Preemptive scheduling with rejection
- Reducibility among combinatorial problems
- Review of the ordered and proportionate flow shop scheduling research
- Single machine scheduling with release dates and rejection
- Techniques for scheduling with rejection
- The Complexity of Flowshop and Jobshop Scheduling
- Two-machine flow shop scheduling problem with an outsourcing option
- Two-machine flow-shop scheduling with rejection
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
Cited in
(13)- Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
- Two-machine flow-shop scheduling with rejection
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
- Flowshop scheduling with learning effect and job rejection
- Regular scheduling measures on proportionate flowshop with job rejection
- Review of the ordered and proportionate flow shop scheduling research
- Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
- Scheduling algorithm for permutation flowshop with limited waiting times and rejection
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
- Machine scheduling with job rejection and Dejong's learning effect
- Proportionate flow shop scheduling with job-dependent due windows and position-dependent weights
- Minimizing total weighted late work in a proportionate flow shop with job rejection
- Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms
This page was built for publication: Proportionate flow shop scheduling with rejection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5359056)
