Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms
From MaRDI portal
Cites work
- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
- A multiple-criterion model for machine scheduling
- A note on makespan minimization in proportionate flow shops
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A note on the proportionate flow shop with a bottleneck machine
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
- A note: minimizing maximum earliness on a proportionate flowshop
- An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop
- An SA/TS mixture algorithm for the scheduling tardiness problem
- Competitive two-agent scheduling and its applications
- Due-window assignment scheduling in the proportionate flow shop setting
- Focused Scheduling in Proportionate Flowshops
- Improved algorithms for proportionate flow shop scheduling with due-window assignment
- Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
- Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
- Minimizing total weighted completion time in a proportionate flow shop
- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
- On J -maximal and J -minimal Flow-Shop Schedules
- On equivalence between the proportionate flow shop and single-machine scheduling problems
- Proportionate flow shop games
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
- Proportionate flow shop scheduling with rejection
- Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
- Proportionate flow shop with controllable processing times
- Proportionate flow shop: new complexity results and models with due date assignment
- Proportionate flowshop scheduling with position-dependent weights
- Regular scheduling measures on proportionate flowshop with job rejection
- Restricted neighborhood in the tabu search for the flowshop problem
- Review of the ordered and proportionate flow shop scheduling research
- Scheduling a proportionate flow shop of batching machines
- Scheduling Problems with Two Competing Agents
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
- Single-machine and two-machine flowshop scheduling with general learning functions
- Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights
- The proportionate flow shop total tardiness problem
- The three-machine proportionate flow shop problem with unequal machine speeds
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
Cited in
(1)
This page was built for publication: Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030972)
