Bicriteria scheduling on parallel machines: total tardiness and weighted flowtime in fuzzy environment

2013 ◽  
Vol 5 (4) ◽  
pp. 492 ◽  
Author(s):  
Sameer Sharma ◽  
Deepak Gupta ◽  
Seema Sharma
Keyword(s):  
Parallel Machines ◽  
Total Tardiness ◽  
Bicriteria Scheduling ◽  
Fuzzy Environment ◽  
Weighted Flowtime

Minimizing Total Earliness and Total Tardiness on Single Machine with Release Dates

2011 ◽  
Vol 5 ◽  
pp. 30-43
Author(s):  
Elkanah Oyetunji ◽  
Ayodeji E. Oluleye
Keyword(s):  
Single Machine ◽  
Single Machine Scheduling ◽  
Total Tardiness ◽  
Release Dates ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Bicriteria Scheduling ◽  
Linear Composite ◽  
Effectiveness And Efficiency ◽  
Machine Scheduling Problems

This paper considers the bicriteria scheduling problem of minimizing the total earliness and the total tardiness on a single machine with release dates. In view of the fact that the problem has been characterized as NP-Hard, we propose two approximation algorithms (labeled as ETA1 and ETA2) for solving the problem. The proposed algorithms were compared with the MA heuristic selected from the literature. The two criteria (the total earliness and the total tardiness) were aggregated together into a linear composite objective function (LCOF). The performances of the algorithms were evaluated based on both effectiveness and efficiency. The algorithms were tested on a set of 1200 randomly generated single machine scheduling problems. Experimental results show that both the ETA1 and ETA2 algorithms outperformed (in terms of effectiveness and efficiency) the MA heuristic under all the considered problem sizes. Also, the ETA1 algorithm outperformed the ETA2 algorithm when the number of jobs (n) ranges between 20 and 500.

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.

Scheduling identical parallel machines to minimize total tardiness

2008 ◽  
Vol 115 (1) ◽  
pp. 134-142 ◽  
Author(s):  
Dirk Biskup ◽  
Jan Herrmann ◽  
Jatinder N.D. Gupta
Keyword(s):  
Parallel Machines ◽  
Total Tardiness ◽  
Identical Parallel Machines
Sign in / Sign up

Export Citation Format

Share Document