scholarly journals Efficient algorithms to minimize Makespan of the unrelated parallel Batch-processing machines scheduling problem with unequal job ready times

2021 ◽  
Author(s):  
yaser zarouk ◽  
javad rezaeian ◽  
iraj mahdavi ◽  
Masoud Yaghini
Keyword(s):  
Processing Speed ◽  
Mixed Integer Linear Programming ◽  
Processing Time ◽  
Original Problem ◽  
Batch Processing ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Batch Processing Machines ◽  
Ready Time

This paper considers the minimization of makespan in the unrelated parallel batch processing machines scheduling problem with considering non-identical job size and dynamic job ready time. The considered unrelated machines have different capacity and different processing speed. Each machine processes a number of the jobs as a batch at the same time so that the machine’s capacity is not exceeded. The batch processing time and the batch ready time are equal to the largest processing time and the largest ready time of jobs in the same batch, respectively. In this paper, a Mixed Integer Linear Programming (MILP) model, two categories of the heuristic procedures (six heuristics) and a meta-heuristic algorithm are proposed to solve the problem. A lower bound is also presented by relaxing of the original problem to evaluate the quality of the proposed algorithms. The computational experiments show the performance of the proposed algorithms under the considered measures.

Solving a bi-objective unrelated parallel batch processing machines scheduling problem: A comparison study

2017 ◽  
Vol 88 ◽  
pp. 71-90 ◽  
Author(s):  
B. Shahidi-Zadeh ◽  
R. Tavakkoli-Moghaddam ◽  
A. Taheri-Moghadam ◽  
I. Rastgar
Keyword(s):  
Batch Processing ◽  
Scheduling Problem ◽  
Comparison Study ◽  
Batch Processing Machines

An Efficient Heuristic Algorithm for Solving Crane Scheduling Problem

2013 ◽  
Vol 442 ◽  
pp. 443-449
Author(s):  
Xie Xie ◽  
Yan Ping Li ◽  
Yong Yue Zheng ◽  
Xiao Li Li
Keyword(s):  
Heuristic Algorithm ◽  
Mixed Integer Linear Programming ◽  
Numerical Experiments ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Crane Scheduling ◽  
Technological Requirement ◽  
Iron And Steel ◽  
Analytical Properties ◽  
Upper Level

This paper focuses on a single crane scheduling problem which is motivated by cooled-rolling material warehouse in the iron and steel enterprise. As storage technological requirement, coils have been stored on the pre-specified position in two levels. If a demanded coil is in the upper level, it can be picked up directly. If a demanded coil in the lower level is blocked by un-demanded coils, the coil can not be transported until all the blocking coils are shuffled to another position. Our problem combines transportation and shuffling simultaneously for crane to pick up all demanded coils as early as possible to designated place (makespan). We first propose a mixed integer linear programming (MILP) model. Some analytical properties are further provided. Based on these properties, we propose a polynomial-time heuristic algorithm. Numerical experiments are carried out to confirm our proposed methods can provide high quality solutions.

scholarly journals A Hybrid IP/GA Approach to the Parallel Production Lines Scheduling Problem

2016 ◽  
Vol 2016 ◽  
pp. 1-11
Author(s):  
Huizhi Ren ◽  
Shenshen Sun
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Time Window ◽  
Valid Inequalities ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Production Lines ◽  
Solution Approach ◽  
Cp Decomposition

A special parallel production lines scheduling problem is studied in this paper. Considering the time window and technical constraints, a mixed integer linear programming (MILP) model is formulated for the problem. A few valid inequalities are deduced and a hybrid mixed integer linear programming/constraint programming (MILP/CP) decomposition strategy is introduced. Based on them, a hybrid integer programming/genetic algorithm (IP/GA) approach is proposed to solve the problem. At last, the numerical experiments demonstrate that the proposed solution approach is effective and efficient.

Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines

2014 ◽  
Vol 31 (05) ◽  
pp. 1450038 ◽  
Author(s):  
Ming Liu ◽  
Feifeng Zheng ◽  
Zhanguo Zhu ◽  
Chengbin Chu
Keyword(s):  
Processing Time ◽  
Online Algorithm ◽  
Machine Scheduling ◽  
Batch Processing ◽  
Batch Processing Machines ◽  
Uncertain Environment ◽  
Processing Machine ◽  
Processing Times ◽  
Batch Processing Machine ◽  
Over Time

Batch processing machine scheduling in uncertain environment attracts more and more attention in the last decade. This paper deals with semi-online scheduling on two parallel batch processing machines with non-decreasing processing time of job. Jobs arrive over time in the online paradigm, and the processing time of any batch is equal to the length of the last arrival job in the batch. We study the unbounded model where each processing batch may contain an unlimited number of jobs, and the objective is to minimize the makespan. Given any job Jj together with its following job Jj+1, it is assumed that their processing times satisfy pj+1 ≥ αpj where α ≥ 1 is a constant. That is, jobs arrive in a non-decreasing order of processing times. We mainly propose an optimal ϕ-competitive online algorithm where ϕ ≥ 1 is a solution of equation ϕ3 + (α-1)ϕ2 + (α2 - α - 1)ϕ - α2 = 0.

scholarly journals Exact and heuristic procedures for the Heijunka-flow shop scheduling problem with minimum makespan and job replicas

2021 ◽  
Author(s):  
Joaquín Bautista-Valhondo
Keyword(s):  
Mixed Integer Linear Programming ◽  
Assembly Line ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Mixed Integer ◽  
Manufacturing Plant ◽  
Shop Scheduling ◽  
Satisfactory Performance

AbstractIn this paper, a new problem of job sequences in a workshop is presented, taking into account non-unit demands for the jobs and whose objective is to minimize the total completion time for all the jobs ($${C}_{max}$$ C max ) satisfying a set of restrictions imposed on the problem to preserve the production mix. Two procedures are proposed to solve the new problem: Mixed Integer Linear Programming and a Metaheuristic based on Multistart and Local Search. The two proposed procedures are tested using instance set Nissan-9Eng.I, in both cases giving rise to highly satisfactory performance both in quality of solutions obtained and in the CPU times required. Through a case study of the Nissan engine manufacturing plant in Barcelona, our economic-productive analysis reveals that it is possible to save an average of € 1162.83 per day, manufacturing 270 engines, when we transform the current assembly line into a Heijunka-Flow Shop.

Sign in / Sign up

Export Citation Format

Share Document