Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
From MaRDI portal
Publication:2958665
DOI10.1007/978-1-4614-1123-9_1zbMath1355.90029OpenAlexW2111127581MaRDI QIDQ2958665
Publication date: 3 February 2017
Published in: Just-in-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-1123-9_1
Related Items
Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection ⋮ On the parameterized tractability of the just-in-time flow-shop scheduling problem ⋮ Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
Cites Work
- Unnamed Item
- Finding the largest suborder of fixed width
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Pre-emptive scheduling problems with controllable processing times
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
- A survey of results for sequencing problems with controllable processing times
- Just-in-time scheduling with controllable processing times on parallel machines
- Scheduling jobs with fixed start and end times
- The maximum k-colorable subgraph problem for chordal graphs
- On chain and antichain families of a partially ordered set
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
- Maximum \(k\)-covering of weighted transitive graphs with applications
- Single machine scheduling subject to deadlines and resource dependent processing times
- Two parallel machine sequencing problems involving controllable job processing times
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Minimizing the total weighted flow time in a single machine with controllable processing times
- On the \(k\)-coloring of intervals
- Single machine scheduling to minimize the number of early and tardy jobs
- A survey of scheduling with controllable processing times
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- Interval scheduling on identical machines
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- A sequential algorithm for finding a maximum weightK-independent set on interval graphs
- Resource Management in Machine Scheduling Problems: A Survey
- Sequencing with Earliness and Tardiness Penalties: A Review
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Multiple Variable-Speed Machines
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Maximum weightk-independent set problem on permutation graphs
- Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
