Bounded serial-batching scheduling for minimizing maximum lateness and makespan

DOI10.1016/J.DISOPT.2015.02.001MaRDI QIDQ1751110zbMATH OpenOpenAlexFDO

Authors Cheng He, Hao Lin, Yanpei Liu

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

zbMATH Keywords

maximum latenessmakespanPareto optimal solutionsboundedbicriteria schedulingserial-batching machine

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
• Bicriteria scheduling on a series-batching machine to minimize makespan and total weighted completion time with equal length job
• Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
• Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives

Cites work

• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• A DP algorithm for minimizing makespan and total completion time on a series-batching machine
• An improved algorithm for a bicriteria batching scheduling problem
• Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Multicriteria scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Groups of Jobs on a Single Machine

Cited in

(16)

• scientific article; zbMATH DE number 7070855 (Why is no real title available?)
• Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
• An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
• Metaheuristics for solving a flexible flow-shop scheduling problem with s-batching machines
• A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
• Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives
• Bi-objective scheduling on a restricted batching machine
• Optimal methods for batch processing problem with makespan and maximum lateness objectives
• Mixed batch scheduling on identical machines
• Improved algorithms for two-agent scheduling on an unbounded serial-batching machine
• Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine
• Unbounded serial-batching scheduling on hierarchical optimization
• Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
• Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
• scientific article; zbMATH DE number 5059917 (Why is no real title available?)

This page was built for publication: Bounded serial-batching scheduling for minimizing maximum lateness and makespan

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751110)