scholarly journals Minimizing the Makespan for Scheduling Problems with General Deterioration Effects

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Xianyu Yu ◽  
Yulin Zhang ◽  
Kai Huang
Keyword(s):  
Processing Time ◽  
Flow Shop ◽  
Single Machine Scheduling ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Processing Times ◽  
Polynomially Solvable ◽  
Machine Scheduling Problems ◽  
Normal Processing

This paper investigates the scheduling problems with general deterioration models. By the deterioration models, the actual processing time functions of jobs depend not only on the scheduled position in the job sequence but also on the total weighted normal processing times of the jobs already processed. In this paper, the objective is to minimize the makespan. For the single-machine scheduling problems with general deterioration effects, we show that the considered problems are polynomially solvable. For the flow shop scheduling problems with general deterioration effects, we also show that the problems can be optimally solved in polynomial time under the proposed conditions.

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.

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.

Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates

2020 ◽  
Vol 37 (01) ◽  
pp. 1950032
Author(s):  
Myoung-Ju Park ◽  
Byung-Cheon Choi ◽  
Yunhong Min ◽  
Kyung Min Kim
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Due Dates ◽  
Shop Scheduling ◽  
Processing Times ◽  
Specific Position ◽  
Polynomially Solvable ◽  
Definition Of ◽  
Tardy Jobs ◽  
Np Hardness

We consider a two-machine flow shop scheduling with two properties. The first is that each due date is assigned for a specific position different from the traditional definition of due dates, and the second is that a consistent pattern exists in the processing times within each job and each machine. The objective is to minimize maximum tardiness, total tardiness, or total number of tardy jobs. We prove the strong NP-hardness and inapproximability, and investigate some polynomially solvable cases. Finally, we develop heuristics and verify their performances through numerical 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.

Flexible flow shop scheduling with interval grey processing time

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Yuquan Wang ◽  
Naiming Xie
Keyword(s):  
Processing Time ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Flexible Flow Shop ◽  
Content Type ◽  
Shop Scheduling ◽  
Scheduling Model ◽  
Grey Number ◽  
Flexible Flow Shop Scheduling

Purposepurpose of this paper is providing a solution for flexible flow shop scheduling problem with uncertain processing time in aeronautical composite lay-up workshop.Design/methodology/approachA flexible flow scheduling model and algorithm with interval grey processing time is established. First, according to actual needs of composite laminate shop scheduling process, interval grey number is used to represent uncertain processing time, and interval grey processing time measurement method, grey number calculation and comparison rules, grey Gantt chart, and other methods are further applied. Then a flexible flow shop scheduling model with interval grey processing time (G-FFSP) is established, and an artificial bee colony algorithm based on an adaptive neighbourhood search strategy is designed to solve the model. Finally, six examples are generated for simulation scheduling, and the efficiency and performance of the model and algorithm are evaluated by comparing the results.FindingsResults show that flexible flow shop scheduling model and algorithm with interval grey processing time can provide an optimal solution for composite lay-up shop scheduling problems and other similar flow shop scheduling problems.Social implicationsUncertain processing time is common in flexible workshop manufacturing, and manual scheduling greatly restricts the production efficiency of workshop. In this paper, combined with grey system theory, an intelligent algorithm is used to solve flexible flow shop scheduling problem to promote intelligent and efficient production of enterprises.Originality/valueThis paper applies and perfects interval grey processing time measurement method, grey number calculation and comparison rules, grey Gantt chart and other methods. A flexible flow shop scheduling model with interval grey processing time is established, and an artificial bee colony algorithm with an adaptive domain search strategy is designed. It provides a comprehensive solution for flexible flow shop scheduling with uncertain processing time.

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

OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING

2012 ◽  
Vol 04 (04) ◽  
pp. 1250051 ◽  
Author(s):  
MING LIU ◽  
CHENGBIN CHU
Keyword(s):  
Online Algorithms ◽  
Processing Time ◽  
Flow Shop ◽  
Optimal Algorithm ◽  
Flow Shop Scheduling ◽  
Shop Scheduling ◽  
Batch Machine ◽  
Processing Times ◽  
Batch Processing Machine ◽  
Over Time

This paper deals with semi-online scheduling on m-batch-machine flow shop. The objective is to minimize the makespan. A parallel batch processing machine can handle up to B jobs simultaneously. We study an unbounded model where B = ∞. The jobs that are processed together construct a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. The problem is online in the sense that jobs arrive over time. Let pi, j(i = 1,…,m) denote the processing time of job Jj on machines Mi, respectively. Let Jj+1 be the following job of Jj in a job instance. We study semi-online problem with jobs' nondecreasing processing times. We focus on the case where p1, j = ⋯ = pm, j for i = 1, …, m and pi, j+1 ≥ βpi, j (β ≥ 1). For this problem, we propose an optimal algorithm [Formula: see text] with a competitive ratio [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document