A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
From MaRDI portal
Recommendations
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- A note: maximizing the weighted number of just-in-time jobs for a given job sequence
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
- A note: minimizing maximum earliness on a proportionate flowshop
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
- A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights
Cites work
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- 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
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Review of the ordered and proportionate flow shop scheduling research
- Scheduling. Theory, algorithms, and systems.
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Single machine scheduling to minimize the number of early and tardy jobs
- The just-in-time scheduling problem in a flow-shop scheduling system
- The Three-Machine No-Wait Flow Shop is NP-Complete
- The three-machine proportionate flow shop problem with unequal machine speeds
Cited in
(18)- Minimizing total weighted completion time in a proportionate flow shop
- A survey of scheduling problems with no-wait in process
- The proportionate flow shop total tardiness problem
- Regular scheduling measures on proportionate flowshop with job rejection
- Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
- A note: minimizing maximum earliness on a proportionate flowshop
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Scheduling a proportionate flow shop of batching machines
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
- A note: maximizing the weighted number of just-in-time jobs for a given job sequence
- Two new approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop
- Improved algorithm for minimizing total late work on a proportionate flow shop and extensions to job rejection and generalized due dates
- Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms
- Just-in-time scheduling with battery constraints
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
This page was built for publication: A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477611)
