scholarly journals Two-machine flow shop with dynamic storage space

2020 ◽  
Author(s):  
Joanna Berlińska ◽  
Alexander Kononov ◽  
Yakov Zinder
Keyword(s):  
Heuristic Algorithms ◽  
Flow Shop ◽  
Mineral Resources ◽  
Multimedia Systems ◽  
Flow Shop Scheduling ◽  
Storage Space ◽  
Scheduling Problems ◽  
Processing Times ◽  
Unit Processing Times ◽  
Permutation Schedule

Abstract The publications on two-machine flow shop scheduling problems with job dependent storage requirements, where a job seizes a portion of the storage space for the entire duration of its processing, were motivated by various applications ranging from supply chains of mineral resources to multimedia systems. In contrast to the previous publications that assumed that the availability of the storage space remains unchanged, this paper is concerned with a more general case when the availability is a function of time. It strengthens the previously published result concerning the existence of an optimal permutation schedule, shows that the variable storage space availability leads to the NP-hardness in the strong sense even for unit processing times, and presents a polynomial-time approximation scheme together with several heuristic algorithms. The heuristics are evaluated by means of computational experiments.

USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS

2009 ◽  
Vol 17 (04) ◽  
pp. 559-584 ◽  
Author(s):  
PENG-JEN LAI ◽  
HSIEN-CHUNG WU
Keyword(s):  
Completion Time ◽  
Ant Colony Algorithm ◽  
Fuzzy Numbers ◽  
Flow Shop ◽  
Computational Procedure ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Processing Times

The flow shop scheduling problems with fuzzy processing times are investigated in this paper. For some special kinds of fuzzy numbers, the analytic formulas of the fuzzy compltion time can be obtained. For the general bell-shaped fuzzy numbers, we present a computational procedure to obtain the approximated membership function of the fuzzy completion time. We define a defuzzification function to rank the fuzzy numbers. Under this ranking concept among fuzzy numbers, we plan to minimize the fuzzy makespan and total weighted fuzzy completion time. Because the ant colony algorithm has been successfully used to solve the scheduling problems with real-valued processing times, we shall also apply the ant colony algorithm to search for the best schedules when the processing times are assumed as fuzzy numbers. Numerical examples are also provided and solved by using the commercial software MATLAB.

A Note on Flow Shop Scheduling with the Effects of Learning and Deterioration

2014 ◽  
Vol 513-517 ◽  
pp. 2149-2152
Author(s):  
Yu Ping Niu ◽  
Ji Bo Wang
Keyword(s):  
Learning Effect ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Processing Times ◽  
Polynomially Solvable ◽  
Machine Scheduling Problems ◽  
Completion Times ◽  
Sum Of Completion Times

In this note, we consider the machine scheduling problems with the effects of learning and deterioration. In this model, job processing times are defined by functions dependent on their starting times and positions in the sequence. The scheduling objectives are makespan, sum of completion times. It is shown that even with the introduction of learning effect and deterioration jobs to job processing times, several flow shop problems remain polynomially solvable.

An effective method for solving flow shop scheduling problems with fuzzy processing times

1993 ◽  
Vol 25 (1-4) ◽  
pp. 239-242 ◽  
Author(s):  
Yasuhiro Tsujimura ◽  
Seung Hun Park ◽  
In Seong Chang ◽  
Mitsuo Gen
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Processing Times ◽  
Fuzzy Processing Times

A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect

2015 ◽  
Vol 32 (02) ◽  
pp. 1550001 ◽  
Author(s):  
Yu-Ping Niu ◽  
Long Wan ◽  
Ji-Bo Wang
Keyword(s):  
Learning Effect ◽  
Flow Shop ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Processing Times ◽  
Effect Model ◽  
Special Cases ◽  
Machine Scheduling Problems

The note deals with machine scheduling problems with a more general learning effect model, i.e., the actual job processing time is a function of the sum of the function of the processing times of the jobs already processed and job position. We show that some single machine scheduling problems are still polynomially solvable under the proposed model. We also show that some special cases of the flow shop scheduling problems can be solved in polynomial time.

OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES

2014 ◽  
Vol 31 (04) ◽  
pp. 1450028 ◽  
Author(s):  
BYUNG-CHEON CHOI ◽  
MYOUNG-JU PARK
Keyword(s):  
Flow Shop ◽  
Performance Measure ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Processing Times ◽  
Permutation Flow Shop Scheduling ◽  
Permutation Flow Shop ◽  
Polynomially Solvable ◽  
Special Case ◽  
Processing Requirement

We consider m-machine permutation flow shop problems with an outsourcing option for a special case where each job's processing time equals the job's processing requirement plus a characteristic value of the machine. The objective is to minimize the sum of the performance measure for in-house jobs (the total completion time or the makespan) and the total outsourcing cost. We prove that two problems are polynomially solvable when the number of machines is fixed.

Sign in / Sign up

Export Citation Format

Share Document