Scheduling identical parallel machines with tooling constraints
type: Item
instance of: scholarly article
title: Scheduling identical parallel machines with tooling constraints
zbMATH Open document ID: 1394.90263
author: Andreza Cristina Beezão
author: Jean-François Cordeau
author: G. Laporte
author: Horacio Hideki Yanasse
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6872971
zbMATH Keywords: flexible manufacturing systems
zbMATH Keywords: parallel machines
zbMATH Keywords: sequence-dependent setup times
zbMATH Keywords: tooling constraints
zbMATH Keywords: adaptive large neighborhood search
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.08.008
OpenAlex ID: W2512395380
cites work: The third comprehensive survey on scheduling problems with setup times/costs
cites work: A survey of scheduling problems with setup times or costs
cites work: Auxiliary tool allocation in flexible manufacturing systems
cites work: A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems
cites work: Improved integer linear programming formulations for the job sequencing and tool switching problem
cites work: Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
cites work: Combinatorial optimization models for production scheduling in automated manufacturing systems
cites work: An adaptive large neighborhood search heuristic for the pollution-routing problem
cites work: Heuristic procedures for the parallel machine problem with tool switches
cites work: Q4198056
cites work: A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
cites work: Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem
cites work: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
cites work: An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
cites work: Due-date based loading and scheduling methods for a flexible manufacturing system with an automatic tool transporter
cites work: The scheduling problem of PCBs for multiple non-identical parallel machines
cites work: The effect of machine availability on the worst-case performance of LPT
cites work: A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
cites work: Heuristic scheduling of parallel machines with sequence-dependent set-up times
cites work: Parallel machines scheduling with nonsimultaneous machine available time
cites work: A note on ''parallel machine scheduling with non-simultaneous machine available time''
cites work: Multiprocessor scheduling: Combining LPT and MULTIFIT
cites work: Tool planning models for flexible manufacturing systems
cites work: A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
cites work: A Survey of Scheduling Rules
cites work: Q4864756
cites work: A general heuristic for vehicle routing problems
cites work: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
cites work: Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems
cites work: Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
cites work: Due date and cost-based FMS loading, scheduling and tool management
DOI: 10.1016/J.EJOR.2016.08.008
Recommended article: Parallel machine scheduling with tool loading
Recommended article: Identical parallel machine scheduling with time-dependent processing times
Recommended article: Q5371426
Recommended article: Scheduling on parallel identical machines to minimize total tardiness
Recommended article: Scheduling identical parallel machines to minimize total weighted completion time
Recommended article: Q3491300
Recommended article: Scheduling identical jobs on uniform parallel machines
Recommended article: Scheduling Identical Parallel Machines with a Fixed Number of Delivery Dates
Recommended article: Rescheduling of identical parallel machines under machine eligibility constraints.
description: scientific article; zbMATH DE number 6872971