scispace - formally typeset

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

AbstractIn this paper, the scheduling of n jobs, all requiring a single stage of processing, on m unrelated parallel machines is considered. The scheduling objective is to minimize the maximum tradiness. An algorithm is proposed for the above problem. Computational results are reported with data generated using various combinations of processing times and due dates. The results show that the proposed algorithm meets the expectations of any scheduling environment.

...read more


Citations
More filters
Journal ArticleDOI
TL;DR: Simulated annealing (SA), a meta-heuristic, is employed in this study to determine a scheduling policy so as to minimize total tardiness, and shows that the proposed SA method significantly outperforms a neighborhood search method in terms of total tardyness.
Abstract: This paper presents a scheduling problem for unrelated parallel machines with sequence-dependent setup times, using simulated annealing (SA). The problem accounts for allotting work parts of L jobs into M parallel unrelated machines, where a job refers to a lot composed of N items. Some jobs may have different items while every item within each job has an identical processing time with a common due date. Each machine has its own processing times according to the characteristics of the machine as well as job types. Setup times are machine independent but job sequence dependent. SA, a meta-heuristic, is employed in this study to determine a scheduling policy so as to minimize total tardiness. The suggested SA method utilizes six job or item rearranging techniques to generate neighborhood solutions. The experimental analysis shows that the proposed SA method significantly outperforms a neighborhood search method in terms of total tardiness.

215 citations


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

  • ...Suresh and Chaudhuri [10] and Adamopoulos and Pappis [11] suggested new heuristics for various due date and processing time combinations....

    [...]

  • ...Given the number of job lots to be processed, for each job pair (i; j), the sequence-dependent setup times sijk on a machine k were randomly chosen from Uniform [10, 90]....

    [...]

Journal ArticleDOI
TL;DR: Four search heuristics are proposed to address the problem, namely the earliest weighted due date, the shortest weighted processing time, the two-level batch scheduling heuristic, and the simulated annealing method.
Abstract: This paper presents several search heuristics and their performance in batch scheduling of parallel, unrelated machines. Identical or similar jobs are typically processed in batches in order to decrease setup times and/or processing times. The problem accounts for allotting batched work parts into unrelated parallel machines, where each batch consists of a fixed number of jobs. Some batches may contain different jobs but all jobs within each batch should have an identical processing time and a common due date. Processing time of each job of a batch is determined according to the machine group as well as the batch group to which the job belongs. Major or minor setup times are required between two subsequent batches depending on batch sequence but are independent of machines. The objective of our study is to minimize the total weighted tardiness for the unrelated parallel machine scheduling. Four search heuristics are proposed to address the problem, namely (1) the earliest weighted due date, (2) the shortest weighted processing time, (3) the two-level batch scheduling heuristic, and (4) the simulated annealing method. These proposed local search heuristics are tested through computational experiments with data from dicing operations of a compound semiconductor manufacturing facility.

117 citations

Journal ArticleDOI
TL;DR: A methodology for minimizing the weighted tardiness of jobs in unrelated parallel machining scheduling with sequence-dependent setups is presented and the use of a specific search algorithm led to identifying solutions of better quality or that required lower computation time, but not both.
Abstract: A methodology for minimizing the weighted tardiness of jobs in unrelated parallel machining scheduling with sequence-dependent setups is presented in this paper. To comply with industrial situations, the dynamic release of jobs and dynamic availability of machines are assumed. Recognizing the inherent difficulty in solving industrial-size problems efficiently, six different search algorithms based on tabu search are developed to identify the best schedule that gives the minimum weighted tardiness. To enhance both the efficiency and efficacy of the search algorithms, four different initial solution finding mechanisms, based on dispatching rules, are developed. While there is no evidence of identifying solutions of better quality by employing a specific initial solution finding mechanism, the use of a specific search algorithm led to identifying solutions of better quality or that required lower computation time, but not both. Based on the extensive statistical analysis performed, the search algorithm with short-term memory and fixed tabu list size is recommended for solving small size problems, while that with long-term memory and minimum frequency for solving medium and large size problems, combined with fixed tabu list size for the former and variable tabu list size for the latter.

113 citations


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

  • ...Keywords: Unrelated parallel machine scheduling; Sequence-dependent setups; Tabu search...

    [...]

  • ...Consider, for instance, the swap between J4 scheduled on M31 and J7 scheduled on M1, in the initial solution....

    [...]

Journal ArticleDOI
TL;DR: This survey reveals that while makespan minimization has been fairly widely studied, problems that include processing characteristics such as release times, sequence dependent setups, and preemptions remain largely unstudied.
Abstract: This paper surveys the literature related to solving traditional unrelated parallel-machine scheduling problems. It compiles algorithms for the makespan, total weighted sum of completion times, maximum tardiness, total tardiness, total earliness and tardiness, and multiple criteria performance measures. The review of the existing algorithms is restricted to the deterministic problems without setups, preemptions, or side conditions on the problem. Even for such traditional problems, this survey reveals that while makespan minimization has been fairly widely studied, problems that include processing characteristics such as release times, sequence dependent setups, and preemptions remain largely unstudied. Research in solving unrelated parallel-machine scheduling problems involving the minimization of the number of tardy jobs, weighted number of tardy jobs, total tardiness, and total weighted tardiness is quite limited.

78 citations


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

  • ...Suresh, V. and D. Chaudhuri, “Minimizing maximum tardiness for unrelated parallel-machines,” International Journal of Production Economics, 34, 223–229 (1994)....

    [...]

  • ...Suresh and Chaudhuri [41], who studied the max||R T problem realized a similar relationship between maxT and maxC ....

    [...]

  • ...Therefore, to solve this problem, Suresh and Chaudhuri [40] developed and tested three heuristics for this problem class....

    [...]

  • ...Like Suresh and Chaudhuri, they modified their PTAS algorithm to solve the bicriteria problem of cost and maxC ....

    [...]

  • ...This type of situation commonly occurs in the drilling operations of PWB Manufacturing [44] machine shops [40], and many other operating centers....

    [...]

Journal ArticleDOI
TL;DR: An effective heuristic based on threshold-accepting methods, tabu lists, and improvement procedures is proposed to minimize total tardiness and significantly outperforms an ATCS procedure and a simulated annealing method for problems in larger sizes.
Abstract: This research deals with scheduling jobs on unrelated parallel machines with auxiliary equipment constraints Each job has a due date and requires a single operation A setup for dies is incurred if there is a switch from processing one type of job to another type For a die type, the number of dies is limited Due to the attributes of the machines and the fitness of dies to each, the processing time for a job depends on the machine on which the job is processed, each job being restricted to processing on certain machines In this paper, an effective heuristic based on threshold-accepting methods, tabu lists, and improvement procedures is proposed to minimize total tardiness An extensive experiment is conducted to evaluate the computational characteristics of the proposed heuristic Computational experiences demonstrate that the proposed heuristic is capable of obtaining optimal solutions for small-sized problems, and significantly outperforms an ATCS procedure and a simulated annealing method for problems in larger sizes

77 citations


References
More filters
Book
01 Jan 1974
Abstract: (1977). Introduction to Sequencing and Scheduling. Journal of the Operational Research Society: Vol. 28, No. 2, pp. 352-353.

2,625 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,340 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.

817 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.
Abstract: We attempt to present in this paper a critical review of a particular segment of scheduling research in which the due to date assignment decision is of primary interest. The literature is classified into the static and dynamic job shop situations. The static job shop is analyzed from two different perspectives: the due date is constrained to be greater than or equal to makespan, and the optimal due date and optimal sequence are to be determined when the method of assigning due dates is specified. The literature on dynamic job shops is also reviewed under two broad categories. First, we discuss all the literature concerned with comparative and investigative studies to identify the most desirable due date assignment method. Second, we discuss the literature dealing with determination of optimal due dates. We note that computer simulation and analytical methods are two common approaches for the second type of problems. We observe 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. Finally, we identify and suggest some worthwhile areas for future research.

492 citations

Journal ArticleDOI
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.

408 citations