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

DOI10.1007/s10288-015-0299-2zbMath1338.90165OpenAlexW2184908043MaRDI QIDQ295879

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

zbMATH Keywords

hierarchical optimizationbatching machinemaximum latenessdouble due dates

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Hierarchical optimization on an unbounded parallel-batching machine

Cites Work

• Unnamed Item
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
• A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
• Scheduling a batching machine
• Improved dynamic programs for some batching problems involving the maximum lateness criterion
• A multiple-criterion model for machine scheduling
• Multicriteria scheduling
• SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION
• Scheduling Problems with Two Competing Agents
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

This page was built for publication: Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness