Bounded serial-batching scheduling for minimizing maximum lateness and makespan
From MaRDI portal
Publication:1751110
DOI10.1016/j.disopt.2015.02.001zbMath1387.90090OpenAlexW2003983870MaRDI QIDQ1751110
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2015.02.001
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (9)
Mixed batch scheduling on identical machines ⋮ Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives ⋮ Improved algorithms for two-agent scheduling on an unbounded serial-batching machine ⋮ Bi-objective scheduling on a restricted batching machine ⋮ Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines ⋮ Unbounded serial-batching scheduling on hierarchical optimization ⋮ Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost ⋮ Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost ⋮ An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- A DP algorithm for minimizing makespan and total completion time on a series-batching machine
- Multicriteria scheduling
- An Improved Algorithm for a Bicriteria Batching Scheduling Problem
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Groups of Jobs on a Single Machine
This page was built for publication: Bounded serial-batching scheduling for minimizing maximum lateness and makespan
