Batch scheduling and common due-date assignment on a single machine
From MaRDI portal
Publication:2563922
Recommendations
- scientific article; zbMATH DE number 6830974
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Scheduling with batch setup times and earliness-tardiness penalties
- Single machine scheduling with common due data assignment in a group technology environment
- Scheduling and common due date assignment on a single parallel-batching machine with batch delivery
Cites work
- Batch sizing and job sequencing on a single machine
- Batching to Minimize Flow Times on One Machine
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improving the complexities of approximation algorithms for optimization problems
- On the Complexity of Scheduling with Batch Setup Times
- One-pass batching algorithms for the one-machine problem
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Survey of scheduling research involving due date determination decisions
- The complexity of one-machine batching problems
Cited in
(25)- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Single machine scheduling with common due data assignment in a group technology environment
- Batch scheduling and common due date assignment problem: An NP-hard case
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Single machine scheduling with assignable due dates
- Scheduling and common due date assignment on a single parallel-batching machine with batch delivery
- Common due date assignment and scheduling with ready times
- Scheduling with batching: A review
- Scheduling the production of two-component jobs on a single machine
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- An almost exact solution to the min completion time variance in a single machine
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- scientific article; zbMATH DE number 6830974 (Why is no real title available?)
- Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized
- scientific article; zbMATH DE number 4059106 (Why is no real title available?)
- scientific article; zbMATH DE number 866105 (Why is no real title available?)
- Scheduling with Agreeable Release Times and Due Dates on a Single Continuous Batch Processing Machine
- Time-flexible min completion time variance in a single machine by quadratic programming
- A lower bound for weighted completion time variance
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Optimal due date assignment in multi-machine scheduling environments
- Two due date assignment problems in scheduling a single machine
- Group sequencing around a common due date
- Optimal due date assignment and resource allocation in a group technology scheduling environment
This page was built for publication: Batch scheduling and common due-date assignment on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563922)
