Minimizing the makespan on two identical parallel machines with mold constraints

DOI10.1016/j.cor.2019.01.005zbMath1458.90277OpenAlexW2910831633WikidataQ128566357 ScholiaQ128566357MaRDI QIDQ1722974

Frank Werner, Jatinder N. D. Gupta, Haidan Zhao, Tsuiping Chung

Publication date: 19 February 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.01.005

zbMATH Keywords

heuristicsmakespanidentical parallel machinesMILP modelwafer fabricationmolds as resource constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times ⋮ Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints ⋮ Two parallel-machine scheduling problems with function constraint ⋮ Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines ⋮ An improved algorithm for parallel machine scheduling under additional resource constraints ⋮ A metric approach for scheduling problems with minimizing the maximum penalty

Cites Work

• Unnamed Item
• Unnamed Item
• Bee colony optimization for scheduling independent tasks to identical processors
• Mathematical programming formulations for machine scheduling: A survey
• Minimizing mean flow time with parallel processors and resource constraints
• Multiprocessor scheduling: Combining LPT and MULTIFIT
• Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment
• An exact algorithm for the identical parallel machine scheduling problem.
• Improved heuristic algorithms for the job sequencing and tool switching problem
• Scheduling identical parallel machines with tooling constraints
• Complexity results for parallel machine problems with a single server
• Scheduling with an orthogonal resource constraint
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods
• Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• Bounds for Multiprocessor Scheduling with Resource Constraints
• An Application of Bin-Packing to Multiprocessor Scheduling
• On the Complexity of Mean Flow Time Scheduling
• Scheduling Parallel Manufacturing Cells with Resource Flexibility
• Heuristic procedures for the parallel machine problem with tool switches
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Minimizing the makespan on two identical parallel machines with mold constraints