Just-in-Time Scheduling with Equal-Size Jobs
From MaRDI portal
Publication:2958671
DOI10.1007/978-1-4614-1123-9_6zbMath1355.90030OpenAlexW124892690MaRDI QIDQ2958671
Nguyen Huynh Toung, Ameur Soukhal
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_6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
- Due dates assignment and JIT scheduling with equal-size jobs
- Equivalence of mean flow time problems and mean absolute deviation problems
- Scheduling around a small common due date
- The complexity of scheduling job families about a common due date
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Parallel machine earliness and tardiness scheduling with proportional weights
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Due-date assignment on uniform machines
- A Decomposition Theorem for Maximum Weight Bipartite Matchings
- New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
- A Fast and Simple Algorithm for the Maximum Flow Problem
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- A new approach to the maximum-flow problem
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Due-date assignment and early/tardy scheduling on identical parallel machines
- New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Algorithms for minclique scheduling problems
