Minimizing makespan for multi-spindle head machines with a mobile table
From MaRDI portal
Publication:954031
DOI10.1016/j.cor.2007.10.010zbMath1163.90489OpenAlexW1972833964MaRDI QIDQ954031
Alexandre Dolgui, Genrikh Levin, Olga Guschinskaya, Nikolai Guschinsky
Publication date: 7 November 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.10.010
schedulinggraph theoryprecedence constraintsbatch processingcompatibility of jobsexclusion and inclusion constraints
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
- Makespan minimization in a no-wait flow shop problem with two batching machines
- Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Scheduling with batching: A review
- Three is easy, two is hard: Open shop sum-batch scheduling problem refined
- A heuristic multi-start decomposition approach for optimal design of serial machining lines
- A special case of transfer lines balancing by graph approach
- Balancing large-scale machining lines with multi-spindle heads using decomposition
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
This page was built for publication: Minimizing makespan for multi-spindle head machines with a mobile table
