Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows
From MaRDI portal
(Redirected from Publication:5861097)
Recommendations
- scientific article; zbMATH DE number 1859343
- A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
- Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
- Just-in-time single-batch-processing machine scheduling
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
Cites work
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
- A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- scientific article; zbMATH DE number 2013754 (Why is no real title available?)
- Modelling of semiconductor wafer fabrication systems by extended object-oriented Petri nets
- Optimal common due-date with limited completion time deviation
- Scheduling the hospital-wide flow of elective patients
- Scheduling with due date assignment under special conditions on job processing
- Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs
- Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
This page was built for publication: Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5861097)