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.012zbMATH Open1352.90035OpenAlexW1984396063MaRDI QIDQ502425FDOQ502425

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

genetic algorithmsschedulingmixed integer linear programmingbatching

Mathematics Subject Classification ID

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

Cited In (7)

• Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling
• Scheduling batch processing machines with incompatible job families
• Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families
• Integrated scheduling on a batch machine to minimize production, inventory and distribution costs
• Bi-objective scheduling on a restricted batching machine
• Stochastic scheduling of a batch processing machine with incompatible job families
• 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

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