Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
From MaRDI portal
(Redirected from Publication:295879)
Recommendations
- Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
- Optimal due date assignment in multi-machine scheduling environments
- Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
- Computing and Combinatorics
- Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
- Unbounded serial-batching scheduling on hierarchical optimization
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
- Scheduling on uniform parallel machines to minimize maximum lateness
Cites work
- scientific article; zbMATH DE number 1634827 (Why is no real title available?)
- A multiple-criterion model for machine scheduling
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
- Improved dynamic programs for some batching problems involving the maximum lateness criterion
- Multicriteria scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Problems with Two Competing Agents
- Scheduling a batching machine
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
- Some improved algorithms on the single machine hierarchical scheduling with total tardiness as the primary criterion
Cited in
(5)- A kind of single machine parallel batch scheduling problems with three hierarchical criteria
- Hierarchical optimization on an unbounded parallel-batching machine
- Hierarchical minimization of two maximum costs on a bounded serial-batching machine
- Unbounded serial-batching scheduling on hierarchical optimization
- Bi-objective scheduling on a restricted batching machine
This page was built for publication: Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q295879)
