scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Minimizing maximum tardiness for unrelated parallel machines

01 Mar 1994-International Journal of Production Economics (Elsevier)-Vol. 34, Iss: 2, pp 223-229
TL;DR: In this article, the scheduling of n jobs, all requiring a single stage of processing, on m unrelated parallel machines is considered, and the scheduling objective is to minimize the maximum tradiness.
About: This article is published in International Journal of Production Economics.The article was published on 1994-03-01. It has received 35 citations till now. The article focuses on the topics: Fair-share scheduling & Flow shop scheduling.
Citations
More filters
Journal ArticleDOI
TL;DR: The proposed MOMSA algorithm can provide a new benchmark for future research related to the unrelated parallel machine scheduling problem addressed in this study and markedly outperformed the benchmark heuristics.
Abstract: This study considers the problem of job scheduling on unrelated parallel machines. A multi-objective multi-point simulated annealing (MOMSA) algorithm was proposed for solving this problem by simultaneously minimising makespan, total weighted completion time and total weighted tardiness. To assess the performance of the proposed heuristic and compare it with that of several benchmark heuristics, the obtained sets of non-dominated solutions were assessed using four multi-objective performance indicators. The computational results demonstrated that the proposed heuristic markedly outperformed the benchmark heuristics in terms of the four performance indicators. The proposed MOMSA algorithm can provide a new benchmark for future research related to the unrelated parallel machine scheduling problem addressed in this study.

51 citations


Cites background from "Minimizing maximum tardiness for un..."

  • ...The UPMSP is a common issue in machine shops (Suresh and Chaudhuri 1994), electronics manufacturing (Yu et al. 2002), CNC machines (Gurel and Akturk 2007) and textiles (Gao, He, and Wang 2009)....

    [...]

Journal ArticleDOI
TL;DR: A simple iterated greedy (IG) heuristic is presented to minimize the total tardiness of this scheduling problem and the effectiveness and efficiency of the proposed IG heuristic are compared with existing algorithms on a benchmark problem dataset used in earlier studies.
Abstract: The unrelated parallel machine scheduling problem with sequence- and machine-dependent setup times in the presence of due date constraints represents an important but relatively less-studied scheduling problem in the literature. In this study, a simple iterated greedy (IG) heuristic is presented to minimize the total tardiness of this scheduling problem. The effectiveness and efficiency of the proposed IG heuristic are compared with existing algorithms on a benchmark problem dataset used in earlier studies. Extensive computational results indicate that the proposed IG heuristic is capable of obtaining significantly better solutions than the state-of-the-art algorithms on the same benchmark problem dataset with similar computational resources.

50 citations


Cites background from "Minimizing maximum tardiness for un..."

  • ...Suresh and Chaudhuri [ 15 ] and Adamopoulos and...

    [...]

  • ...Proportion of jobs from primary customers (P) 0.2, 0.3 Speed factor for jobs of family q on machine m, fmq 1/U [5, 15 ]...

    [...]

Journal ArticleDOI
TL;DR: In this paper, the authors proposed several hybrid metaheuristics for unrelated parallel-machine scheduling problem with sequence-dependent setup times given the objective of minimizing the weighted number of tardy jobs.
Abstract: This paper proposes several hybrid metaheuristics for the unrelated parallel-machine scheduling problem with sequence-dependent setup times given the objective of minimizing the weighted number of tardy jobs. The metaheuristics begin with effective initial solution generators to generate initial feasible solutions; then, they improve the initial solutions by an approach, which integrates the principles of the variable neighborhood descent approach and tabu search. Four reduced-size neighborhood structures and two search strategies are proposed in the metaheuristics to enhance their effectiveness and efficiency. Five factors are used to design 32 experimental conditions, and ten test problems are generated for each condition. Computational results show that the proposed hybrid metaheuristics are significantly superior to several basic tabu search heuristics under all the experimental conditions.

47 citations


Cites methods from "Minimizing maximum tardiness for un..."

  • ...Suresh and Chaudhuri [ 8 ] developed a GAP– EDD algorithm minimizing the maximum tardiness, while Chen [9] presented a TS heuristic with the same objective considering problems with job setup times....

    [...]

Journal ArticleDOI
TL;DR: In this paper, a method that combines learning curves and job scheduling heuristics aimed at minimising the total weighted earliness and tardiness is presented, where workers performance data is collected and modelled using learning curves, enabling a better estimation of the completion time of jobs with different size and complexity.
Abstract: The large variety of product models required by customised markets implies lot size reduction. This strongly affects manual-based production activities, since workers need to promptly adapt to the specifications of the next model to be produced. Completion times of manual-based activities tend to be highly variable among workers, and are difficult to estimate. This affects the scheduling of those activities since scheduling precision depends on reliable estimates of job completion times. This paper presents a method that combines learning curves and job scheduling heuristics aimed at minimising the total weighted earliness and tardiness. Workers performance data is collected and modelled using learning curves, enabling a better estimation of the completion time of jobs with different size and complexity. Estimated completion times are then inputted in new scheduling heuristics for unrelated parallel workers, equivalent to machines in this study, created by modifying heuristics available in the literature....

34 citations


Additional excerpts

  • ...Additional approaches for tardiness minimisation on unrelated parallel machines are reported by Suresh and Chaudhuri (1994), and Randahwa and Kuo (1997)....

    [...]

Journal ArticleDOI
TL;DR: In this paper, a tabu search is used to schedule the drilling operation of the printed circuit board in a near optimal manner under various constraints, such as the shop orders are all different based on their application purpose such as in PC industries or telecommunication applications, i.e. the cellular phones.

34 citations

References
More filters
Book
01 Jan 1974
TL;DR: In this article, the authors present an introduction to Sequencing and Scheduling in the context of the Operational Research Society (ORS) and the International Journal of Distributed Sensor Networks (ILS).
Abstract: (1977). Introduction to Sequencing and Scheduling. Journal of the Operational Research Society: Vol. 28, No. 2, pp. 352-353.

2,640 citations

Book
01 Jan 1967
TL;DR: Reading theory of scheduling as one of the reading material to finish quickly to increase the knowledge and happiness in your lonely time.
Abstract: Feel lonely? What about reading books? Book is one of the greatest friends to accompany while in your lonely time. When you have no friends and activities somewhere and sometimes, reading book can be a great choice. This is not only for spending the time, it will increase the knowledge. Of course the b=benefits to take will relate to what kind of book that you are reading. And now, we will concern you to try reading theory of scheduling as one of the reading material to finish quickly.

2,356 citations

Journal ArticleDOI
TL;DR: The problem of this paper is that of scheduling several one-stage tasks on several processors, which are capable of handling the tasks with varying degrees of efficiency, to minimize the total loss, which is a sum of losses associated with the individual tasks.
Abstract: The problem of this paper is that of scheduling several one-stage tasks on several processors, which are capable of handling the tasks with varying degrees of efficiency, to minimize the total loss, which is a sum of losses associated with the individual tasks. Each task has a deadline; the individual loss associated with it is a function of amount of time between the deadline and the time of completion if the former precedes the latter, and zero otherwise.

843 citations

Journal ArticleDOI
TL;DR: A critical review of a particular segment of scheduling research in which the due to date assignment decision is of primary interest is presented, observing that while the static single- machine problem with constant or common due dates has been well researched, very little or no work has been done on the dynamic multi-machine problem with sophisticated due date assignment methods.

498 citations

Journal ArticleDOI
TL;DR: In this article, the problem of scheduling semiconductor burn-in operations is modeled as batch processing machines, where the processing time of a batch is equal to the largest processing time among all jobs in the batch.
Abstract: In this paper, we study the problem of scheduling semiconductor burn-in operations, where burn-in ovens are modeled as batch processing machines. A batch processing machine is one that can process up to B jobs simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. We present efficient dynamic programming-based algorithms for minimizing a number of different performance measures on a single batch processing machine. We also present heuristics for a number of problems concerning parallel identical batch processing machines and we provide worst case error bounds.

433 citations