Scheduling in flowshops to minimize total tardiness of jobs

doi:10.1080/00207540310001657595

Home
/
Papers
/
Scheduling in flowshops to minimize total tardiness of jobs

Journal Article•DOI•

Scheduling in flowshops to minimize total tardiness of jobs

Sameer Hasija¹, Chandrasekharan Rajendran¹•Institutions (1)

Indian Institute of Technology Madras¹

01 Jun 2004-International Journal of Production Research (Taylor & Francis Group)-Vol. 42, Iss: 11, pp 2289-2301

TL;DR: The performance of the proposed SA algorithm is found to be very good, and the proposed heuristic performs better than the existing heuristics.

read less

Abstract: The problem of scheduling in static flowshops is considered with the objective of minimizing mean or total tardiness of jobs. A heuristic algorithm based on the simulated annealing (SA) technique is developed. The salient features of the proposed SA algorithm are the development of two new perturbation schemes for use in the proposed SA algorithm and a new improvement scheme to improve the quality of the solutions. The proposed algorithm is evaluated by using the benchmark problems available in the literature. The performance of the proposed SA algorithm is found to be very good, and the proposed heuristic performs better than the existing heuristics.

...read moreread less

Citations

PDF

Open Access

More filters

Proceedings Article•DOI•

An Improvement of Instance Generator Featuring Assembly Operations with Parallel Machines for Multi-Level and Multi-Operation Scheduling Problems

[...]

Watchara Songserm¹, Jakkrit Latthawanichphan², Teeradej Wuttipornpun², Watcharapan Sukkerd¹•Institutions (2)

Rajamangala University of Technology¹, King Mongkut's University of Technology North Bangkok²

01 Sep 2021

TL;DR: In this article, an improvement of instance generator for scheduling problems called i-IGSP is proposed, which integrates an assembly operation option with parallel machines to all types of multi-level and multi-operation production shops, known as flow shop and job shop.

...read moreread less

Abstract: This paper proposes an improvement of instance generator for scheduling problems called i-IGSP. There are three significant improvements from the existing IGSP. The first feature is the main contribution of this paper, which is the integration of an assembly operation option with parallel machines to all types of multi-level and multi-operation production shops, known as flow shop and job shop. These shops have been found in many modern industries and scheduling researches at the present. The second feature provides the choice of due time scenarios. The third enhancement makes the output text files more consistent and for all production shops. Based on the improvements, i-IGSP has become one of the most completed instance generators for scheduling problems than the other instance generators published in the literature. Researchers can use it to not only to evaluate their algorithms and generate benchmark problems but also to save time and cost of data collection from real industries.

...read moreread less

1 citations

Journal Article•DOI•

A review and classification on distributed permutation flowshop scheduling problems

[...]

Paz Perez-Gonzalez, Jose M. Framinan

01 Feb 2023-European Journal of Operational Research

TL;DR: The Distributed Permutation Flowshop Scheduling (DPFS) problem is one of the fastest-growing topics in the scheduling literature, which in turn is among the most prolific fields in Operational Research (OR) as discussed by the authors .

...read moreread less

1 citations

Bloki w problemie przepływowym z minimalizacją sumy kosztów opóźnień

[...]

Wojciech Bożejko, J. Grabowski, Mieczysław Wodecki

01 Jan 2007

1 citations

Journal Article•DOI•

A linear programming approach for hybrid flexible flow shop with sequence-dependent setup times to minimise total tardiness.

[...]

S. Oujana, Farouk Yalaoui, Lionel Amodeo

01 Jan 2021-IFAC-PapersOnLine

1 citations

Scheduling a permutation flowshop with sequence-dependent family setups to minimize total tardiness

[...]

Jeffrey E. Schaller, Jatinder N. D. Gupta

17 Nov 2012

TL;DR: In this article, the authors present procedures for scheduling a permutation flowshop with sequence-dependent family setups when the objective is to minimize total tardiness, and test these procedures on several problem sets.

...read moreread less

Abstract: This paper presents procedures for scheduling a permutation flowshop with sequence-dependent family setups when the objective is to minimize total tardiness. These procedures are tested on several problem sets. The results show that neighborhood searches that include neighborhoods based on batches of jobs and genetic algorithms are most effective.

...read moreread less

Cites methods from "Scheduling in flowshops to minimize..."

..., 1996) were the best heuristics and simulated annealing algorithms developed by (Parthasarathy and Rajendran, 1997) and (Hasija and Rajendran, 2004) were the best meta-heuristics....
[...]
...Based on their tests (Vallada and Minella, 2008) found that the neighborhood searches developed by (Kim et al., 1996) were the best heuristics and simulated annealing algorithms developed by (Parthasarathy and Rajendran, 1997) and (Hasija and Rajendran, 2004) were the best meta-heuristics....
[...]
...(Framinan and Leisten, 2008) developed variable greedy algorithms and found them to be more effective than the procedure developed by (Hasija and Rajendran, 2004) in computational tests....
[...]

1
2
3
4
5
6
7
8
9
10
…
11
12
13
14
15

Collapse

References

PDF

Open Access

More filters

Journal Article•DOI•

Optimal two- and three-stage production schedules with setup times included

[...]

Selmer Martin Johnson¹•Institutions (1)

RAND Corporation¹

01 Mar 1954-Naval Research Logistics Quarterly

TL;DR: A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum.

...read moreread less

Abstract: Each of a collection of items are to be produced on two machines (or stages). Each machine can handle only one item at a time and each item must be processed through machine one and then through machine two. The setup time plus work time for each item for each machine is known. A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum. A three-machine problem is also discussed and solved for a restricted case.

...read moreread less

3,082 citations

Journal Article•DOI•

A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem

[...]

Muhammad Nawaz¹, E. Emory Enscore², Inyong Ham²•Institutions (2)

University College of Engineering¹, Pennsylvania State University²

01 Jan 1983-Omega-international Journal of Management Science

TL;DR: A simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics, and performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.

...read moreread less

Abstract: In a general flow-shop situation, where all the jobs must pass through all the machines in the same order, certain heuristic algorithms propose that the jobs with higher total process time should be given higher priority than the jobs with less total process time. Based on this premise, a simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics. The results of the proposed algorithm have been compared with the results from 15 other algorithms in an independent study by Park [13], who shows that the proposed algorithm performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.

...read moreread less

2,255 citations

Additional excerpts

...Some of the noteworthy heuristics for minimizing makespan have been developed by Campbell et al. (1970), Dannenbring (1977), Nawaz et al. (1983), Widmer and Hertz (1989), Leisten (1990), Ogbu and Smith (1990), Ishibuchi et al. (1995), Rajendran (1995), Nowicki and Smutnicki (1996), Rajendran and…...
[...]

Journal Article•DOI•

Benchmarks for basic scheduling problems

[...]

Éric D. Taillard¹•Institutions (1)

École Polytechnique Fédérale de Lausanne¹

22 Jan 1993-European Journal of Operational Research

TL;DR: This paper proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published, and the objective is the minimization of the makespan.

...read moreread less

2,173 citations

"Scheduling in flowshops to minimize..." refers methods in this paper

...The test problems chosen for evaluating the heuristics under study are the benchmark problems proposed by Taillard (1993)....
[...]
...T 0i ¼ Xm j¼1 tij : ð11Þ Step 2: The due date of job i is given by Di ¼ T 0i ½1þ u 3 , ð12Þ where u is a uniform random number, generated using the routine given by Taillard (1993), in the range [0, 1]....
[...]
...The best-performing existing heuristics by Parthasarathy and Rajendran (1998) and Armentano and Ronconi (1999), and the proposed heuristic, are compared by using the benchmark problems of Taillard (1993)....
[...]

Journal Article•DOI•

A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

[...]

Herbert G. Campbell¹, Richard A. Dudek¹, Milton L. Smith¹•Institutions (1)

Texas Tech University¹

01 Jun 1970-Management Science

TL;DR: A simple algorithm for the solution of very large sequence problems without the use of a computer that produces approximate solutions to the n job, m machine sequencing problem where no passing is considered and the criterion is minimum total elapsed time.

...read moreread less

Abstract: This paper describes a simple algorithm for the solution of very large sequence problems without the use of a computer. It produces approximate solutions to the n job, m machine sequencing problem where no passing is considered and the criterion is minimum total elapsed time. Up to m-1 sequences may be found.

...read moreread less

921 citations

Additional excerpts

...Some of the noteworthy heuristics for minimizing makespan have been developed by Campbell et al. (1970), Dannenbring (1977), Nawaz et al. (1983), Widmer and Hertz (1989), Leisten (1990), Ogbu and Smith (1990), Ishibuchi et al. (1995), Rajendran (1995), Nowicki and Smutnicki (1996), Rajendran and…...
[...]

Journal Article•DOI•

Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems

[...]

Edward Ignall¹, Linus Schrage¹•Institutions (1)

Cornell University¹

01 Jun 1965-Operations Research

TL;DR: In this paper, the branch-and-bound technique was applied to two flow-shop scheduling problems, i.e., 2-machine and 3-machine, with the objective of minimizing the makespan.

...read moreread less

Abstract: The branch-and-bound technique of Little, et al. and Land and Doig is presented and then applied to two flow-shop scheduling problems. Computational results for up to 9 jobs are given for the 2-machine problem when the objective is minimizing the mean completion time. This problem was previously untreated. Results for up to 10 jobs, including comparisons with other techniques, are given for the 3-machine problem when the objective is minimizing the makespan.

...read moreread less

575 citations