Just-in-time scheduling with equal-size jobs
From MaRDI portal
Publication:2958671
Recommendations
- Due dates assignment and JIT scheduling with equal-size jobs
- scientific article; zbMATH DE number 4059106
- Single machine batch just-in-time scheduling problems with common batch size and common due date of jobs
- Scheduling to minimize weighted earliness and tardiness about a common due-date
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
Cites work
- scientific article; zbMATH DE number 4059106 (Why is no real title available?)
- scientific article; zbMATH DE number 167292 (Why is no real title available?)
- A Fast and Simple Algorithm for the Maximum Flow Problem
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- A decomposition theorem for maximum weight bipartite matchings
- A new approach to the maximum-flow problem
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Algorithms for minclique scheduling problems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Due dates assignment and JIT scheduling with equal-size jobs
- Due-date assignment and early/tardy scheduling on identical parallel machines
- Due-date assignment on uniform machines
- 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
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
- Equivalence of mean flow time problems and mean absolute deviation problems
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Minimizing the average deviation of job completion times about a common due date
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
- New exact algorithms for one-machine earliness-tardiness scheduling
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Parallel machine earliness and tardiness scheduling with proportional weights
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Scheduling around a small common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines
- The complexity of scheduling job families about a common due date
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(7)- Mixed integer formulations using natural variables for single machine scheduling around a common due date
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- Time-of-use scheduling problem with equal-length jobs
- Due dates assignment and JIT scheduling with equal-size jobs
- Scheduling unit processing time jobs on an m-machine flow-shop
- Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
- Parallel machine scheduling with common due windows
This page was built for publication: Just-in-time scheduling with equal-size jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958671)
