A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
From MaRDI portal
Publication:477611
DOI10.1016/J.IPL.2014.09.004zbMATH Open1302.90081OpenAlexW1981229180MaRDI QIDQ477611FDOQ477611
Authors: Enrique Gerstl, Baruch Mor, Gur Mosheiov 
Publication date: 9 December 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.004
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
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Scheduling. Theory, algorithms, and systems.
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Review of the ordered and proportionate flow shop scheduling research
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- Single machine scheduling to minimize the number of early and tardy jobs
- Minimizing total weighted completion time in a proportionate flow shop
- The just-in-time scheduling problem in a flow-shop scheduling system
- The three-machine proportionate flow shop problem with unequal machine speeds
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
Cited In (13)
- An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
- Scheduling a proportionate flow shop of batching machines
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Regular scheduling measures on proportionate flowshop with job rejection
- A note: minimizing maximum earliness on a proportionate flowshop
- The proportionate flow shop total tardiness problem
- Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
- A note: maximizing the weighted number of just-in-time jobs for a given job sequence
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- A survey of scheduling problems with no-wait in process
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)
