Non-identical parallel machines batch processing problem to minimize the makespan : Models and algorithms

• This paper studies a parallel heterogeneous machine batching and scheduling problem in which weighted jobs are first batched, and the batches are then assigned and sequenced on machines of varying capacities. The duration of a batch is the longest time needed to process a job, and the objective is that of minimizing the makespan, or the sum of the batches durations on the machine finishing last. The authors develop polynomial-size mathematical formulations and a variable neighborhood search metaheuristic. Extensive computational results suggest that the flow-based formulation outperforms a compact formulation, despite its larger number of variables. The metaheuristic is capable of producing high-quality solutions within a limited computing time.

Ämnesord

NATURVETENSKAP  -- Matematik -- Beräkningsmatematik (hsv//swe)

NATURAL SCIENCES  -- Mathematics -- Computational Mathematics (hsv//eng)

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Datorsystem (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Computer Systems (hsv//eng)

Nyckelord

Parallel machines

batch processing machines

makespan minimization

variable neighborhood search

Virtual Production Development (VPD)

Virtual Production Development (VPD)

Publikations- och innehållstyp

ref (ämneskategori)

art (ämneskategori)