Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness

DOI10.1007/S10288-015-0299-2zbMATH Open1338.90165OpenAlexW2184908043MaRDI QIDQ295879FDOQ295879

Authors: Cheng He, Hao Lin 

Publication date: 14 June 2016

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-015-0299-2

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

zbMATH Keywords

maximum latenessbatching machinedouble due dateshierarchical optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
• Scheduling a batching machine
• A multiple-criterion model for machine scheduling
• Scheduling Problems with Two Competing Agents
• Improved dynamic programs for some batching problems involving the maximum lateness criterion
• Multicriteria scheduling
• Title not available (Why is that?)
• Some improved algorithms on the single machine hierarchical scheduling with total tardiness as the primary criterion
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan

Cited In (5)

• Hierarchical minimization of two maximum costs on a bounded serial-batching machine
• Bi-objective scheduling on a restricted batching machine
• A kind of single machine parallel batch scheduling problems with three hierarchical criteria
• Unbounded serial-batching scheduling on hierarchical optimization
• Hierarchical optimization on an unbounded parallel-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)