Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows

DOI10.1080/13873954.2017.1394327zbMath1485.93381OpenAlexW2765387853MaRDI QIDQ5861097

Hao Chen, Wenyou Jia, Li Liu, You Li

Publication date: 4 March 2022

Published in: Mathematical and Computer Modelling of Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/13873954.2017.1394327

zbMATH Keywords

decomposition methodschedulingtime windowre-entrant batch processing machineslack mixed integer linear programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Control/observation systems involving computers (process control, etc.) (93C83)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Scheduling the hospital-wide flow of elective patients
• A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty
• Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs
• Optimal common due-date with limited completion time deviation
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
• Scheduling with due date assignment under special conditions on job processing
• Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
• Modelling of semiconductor wafer fabrication systems by extended object-oriented Petri nets

This page was built for publication: Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows