Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems
From MaRDI portal
Publication:256691
DOI10.1007/s10479-015-1976-4zbMath1332.90117OpenAlexW1212267305MaRDI QIDQ256691
Publication date: 9 March 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1976-4
schedulingcomputational experimentsgrouping genetic algorithmmultiple orders per jobsemiconductor manufacturing
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date ⋮ Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integrated heuristics for scheduling multiple order jobs in a complex job shop
- Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
- Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem
- Multiple orders per job batch scheduling with incompatible jobs
- Column generation heuristics for multiple machine, multiple orders per job scheduling problems
- Scheduling multiple orders per job in a single machine to minimize total completion time
- Impact of the replacement heuristic in a grouping genetic algorithm.
- A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
- A grouping genetic algorithm for the pickup and delivery problem with time windows
- Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
