Hybrid flexible flowshop scheduling problem with unrelated parallel machines and limited waiting times

2013 ◽  
Vol 68 (5-8) ◽  
pp. 1583-1599 ◽  
Author(s):  
S. F. Attar ◽  
M. Mohammadi ◽  
R. Tavakkoli-Moghaddam
Keyword(s):  
Parallel Machines ◽  
Waiting Times ◽  
Scheduling Problem ◽  
Unrelated Parallel Machines ◽  
Flowshop Scheduling ◽  
Flexible Flowshop ◽  
Flowshop Scheduling Problem ◽  
Hybrid Flexible Flowshop

A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD

2009 ◽  
Vol 26 (06) ◽  
pp. 817-829 ◽  
Author(s):  
XIAOFENG HU ◽  
JINGSONG BAO ◽  
YE JIN
Keyword(s):  
Tabu Search ◽  
Parallel Machines ◽  
Search Algorithm ◽  
Real Data ◽  
Total Tardiness ◽  
Tabu Search Algorithm ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Pipe Processing ◽  
Flowshop Scheduling Problem

This paper focuses on scheduling problem of a pipe-processing flowshop in a shipyard. The flowshop composes of five stages, including cutting, bending, welding preprocessing, argon-welding and CO 2-welding, and each stage consists of identical parallel machines. Since thousands of pipes are mounted on the hull block before erection, the pipe-processing scheduling is a critical task for shipbuilding to meet the due date of the block erection. A tabu search algorithm is developed for the scheduling problem with the objective of minimizing total tardiness. Computational experiments are performed on the collected real data. Results show that the proposed algorithm is efficient for this problem.

A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM

2007 ◽  
Vol 24 (01) ◽  
pp. 45-56 ◽  
Author(s):  
LONGMIN HE ◽  
SHIJIE SUN ◽  
RUNZI LUO
Keyword(s):  
Processing Time ◽  
Parallel Machines ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Two Stage ◽  
Batch Processor ◽  
Flowshop Scheduling Problem ◽  
Stage 1

This paper considers a batch scheduling problem in a two-stage hybrid flowshop that consists of m dedicated parallel machines in stage 1 and a batch processor in stage 2. The processing time of a batch is defined as the largest processing time of the jobs contained in that batch. The criterion is to minimize the makespan, the time by which all operations of jobs have been processed. For such a problem, we present a polynomial time algorithm for the case with all jobs having the same processing time on the batch processor. An approximation algorithm with a competitive ratio 2 for the general case is also presented.

Neighborhood Search Heuristic for 2-Machine Flowshop Scheduling Problem with Limited Waiting Times

2013 ◽  
Vol 411-414 ◽  
pp. 1894-1897 ◽  
Author(s):  
Bai Lin Wang ◽  
Tie Ke Li ◽  
Heng Bo Ge
Keyword(s):  
Waiting Time ◽  
Search Algorithm ◽  
Waiting Times ◽  
Time Constraints ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Effectiveness And Efficiency ◽  
Flowshop Scheduling Problem ◽  
Neighborhood Search Algorithm

The flowshop scheduling problem with limited waiting time constraints widely exists in the production process featured by high temperature and continuity. The constraints require that the waiting time of any job between two consecutive machines is not greater than a given upper bound. In this paper, the problem with two-machine settings and the objective of makespan is studied. First, a lower bound and some characters of minimum makespan are analyzed. Further, a solving idea is suggested by a transformation into an asymmetry TSP. Based on these characteristics and the solving idea, a neighborhood search algorithm embedding a modified Lin-Kernighan heuristic is presented for the problem. Numerical results demonstrated the effectiveness and efficiency of the algorithm.

Sign in / Sign up

Export Citation Format

Share Document