Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective
From MaRDI portal
Publication:502425
DOI10.1016/J.COR.2012.12.012zbMATH Open1352.90035OpenAlexW1984396063MaRDI QIDQ502425FDOQ502425
Authors: Stèphane Dauzère-Pérès, Lars Mönch 
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
Recommendations
- Scheduling batch processing machines with incompatible job families
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- Solving single batch-processing machine problems using an iterated heuristic
- Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families
- scientific article; zbMATH DE number 1859343
Cited In (8)
- 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
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- 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
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)
