Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective

DOI10.1016/J.COR.2012.12.012zbMath1352.90035OpenAlexW1984396063MaRDI QIDQ502425

Lars Mönch, Stéphane Dauzère-Pérès

Publication date: 5 January 2017

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.12.012

zbMATH Keywords

schedulinggenetic algorithmsbatchingmixed integer linear programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Integrated scheduling on a batch machine to minimize production, inventory and distribution costs ⋮ Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families ⋮ Bi-objective scheduling on a restricted batching machine ⋮ A survey of scheduling with parallel batch (p-batch) processing

Uses Software

• GALib

This page was built for publication: Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective