Minimizing makespan for multi-spindle head machines with a mobile table

DOI10.1016/J.COR.2007.10.010zbMATH Open1163.90489OpenAlexW1972833964MaRDI QIDQ954031FDOQ954031

Authors: Olga Guschinskaya, Alexandre Dolgui, Nikolai Guschinsky, Genrikh Levin 

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

Recommendations

• Scheduling flexible manufacturing cells using tabu search
• Solving the serial batching problem in job shop manufacturing systems
• Scheduling Parallel Manufacturing Cells with Resource Flexibility
• Minimizing production flow time in a process and assembly job shop
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness

zbMATH Keywords

graph theoryschedulingprecedence constraintsbatch processingcompatibility of jobsexclusion and inclusion constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Scheduling with batching: A review
• 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
• 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
• A special case of transfer lines balancing by graph approach
• A heuristic multi-start decomposition approach for optimal design of serial machining lines
• Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search
• Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
• Title not available (Why is that?)
• Title not available (Why is that?)
• Makespan minimization in a no-wait flow shop problem with two batching machines
• Three is easy, two is hard: Open shop sum-batch scheduling problem refined
• Balancing large-scale machining lines with multi-spindle heads using decomposition

Cited In (1)

• Equipment location in machining transfer lines with multi-spindle heads

This page was built for publication: Minimizing makespan for multi-spindle head machines with a mobile table

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954031)