SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION

DOI10.1142/S0217595910002867zbMath1203.90066MaRDI QIDQ3069759

Yanpei Liu, Cheng He, Jinjiang Yuan

Publication date: 19 January 2011

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

bicriteria schedulingbatch processing machinetotal tardiness

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness ⋮ Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan

Cites Work

• Bicriterion scheduling with equal processing times on a batch processing machine
• Scheduling a batching machine
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION