scholarly journals A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates

2004 ◽  
Vol 158 (3) ◽  
pp. 595-608 ◽  
Author(s):  
Philippe Baptiste ◽  
Jacques Carlier ◽  
Antoine Jouglet
Keyword(s):  
Branch And Bound ◽  
Total Tardiness ◽  
Release Dates ◽  
One Machine

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.

scholarly journals A Two-Stage Assembly-Type Flowshop Scheduling Problem for Minimizing Total Tardiness

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Ju-Yong Lee ◽  
June-Young Bang
Keyword(s):  
Lower Bounds ◽  
Branch And Bound ◽  
Total Tardiness ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Two Stage ◽  
Algorithm Performance ◽  
Second Stage ◽  
Flowshop Scheduling Problem ◽  
Dominance Properties

This research considers a two-stage assembly-type flowshop scheduling problem with the objective of minimizing the total tardiness. The first stage consists of two independent machines, and the second stage consists of a single machine. Two types of components are fabricated in the first stage, and then they are assembled in the second stage. Dominance properties and lower bounds are developed, and a branch and bound algorithm is presented that uses these properties and lower bounds as well as an upper bound obtained from a heuristic algorithm. The algorithm performance is evaluated using a series of computational experiments on randomly generated instances and the results are reported.

Sign in / Sign up

Export Citation Format

Share Document