Showing papers on "Job shop published in 1996"
TL;DR: A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in a job shop is presented, based on a taboo search technique with a specific neighborhood definition which employs a critical path and blocks of operations notions.
Abstract: A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in a job shop is presented. The algorithm is based on a taboo search technique with a specific neighborhood definition which employs a critical path and blocks of operations notions. Computational experiments up to 2,000 operations show that the algorithm not only finds shorter makespans than the best approximation approaches but also runs in shorter time. It solves the well-known 10 × 10 hard benchmark problem within 30 seconds on a personal computer.
964 citations
TL;DR: Several well-documented applications of no-wait and blocking scheduling models are described and some ways in which the increasing use of modern manufacturing methods gives rise to other applications are illustrated.
Abstract: An important class of machine scheduling problems is characterized by a no-wait or blocking production environment, where there is no intermediate buffer between machines. In a no-wait environment, a job must be processed from start to completion, without any interruption either on or between machines. Blocking occurs when a job, having completed processing on a machine, remains on the machine until a downstream machine becomes available for processing. A no-wait or blocking production environment typically arises from characteristics of the processing technology itself, or from the absence of storage capacity between operations of a job. In this review paper, we describe several well-documented applications of no-wait and blocking scheduling models and illustrate some ways in which the increasing use of modern manufacturing methods gives rise to other applications. We review the computational complexity of a wide variety of no-wait and blocking scheduling problems and describe several problems which remain open as to complexity. We study several deterministic flowshop, jobshop, and openshop problems and describe efficient and enumerative algorithms, as well as heuristics and results about their performance. The literature on stochastic no-wait and blocking scheduling problems is also reviewed. Finally, we provide some suggestions for future research directions.
815 citations
TL;DR: A tutorial survey of recent works on solving classical JSP using genetic algorithms using various hybrid approaches of genetic algorithms and conventional heuristics is given.
639 citations
TL;DR: A job shop consists of a set of different machines that perform operations on jobs, each job is composed of an ordered list of operations each of which is determined by the machine required and the processing time on it.
548 citations
Book•
31 Dec 1996
TL;DR: A meta-modelling framework for modelling Interactions Between Subproblems and the Effects of Subproblem Solution Procedures and Control Structures is presented.
Abstract: Preface. 1. Introduction. 2. Industrial Context and Motivation for Decomposition Methods. 3. Review of Decomposition Methods for Factory Scheduling Problems. 4. Modelling Interactions Between Subproblems: The Disjunctive Graph Representation and Extensions. 5. Workcenter-Based Decomposition Procedures for the Classical Job Shop Environment. 6. A Generic Decomposition Procedure for Semiconductor Testing Facilities. 7. Time-Based Decomposition Procedures for Single-Machine Subproblems with Sequence-Dependent Setup Times. 8. Time-Based Decomposition Procedures for Parallel Machine Subproblems with Sequence-Dependent Setup Times. 9. Naive Rolling Horizon Procedures for Job Shop Scheduling. 10. Tailored Decomposition Procedures for Semiconductor Testing Facilities. 11. Computational Results for Job Shops with Single and Parallel Machine Workcenters. 12. The Effects of Subproblem Solution Procedures and Control Structures. 13. Conclusions and Future Directions. Author Index.
211 citations
01 Jan 1996
TL;DR: In this paper, the authors present an overview of Adaptive Scheduling and Evolutionary Algorithms for job shop and local search techniques, as well as population flow in adaptive scheduling.
Abstract: 1. Introduction.- 2. Job Shop Scheduling.- 3. Local Search Techniques.- 4. Evolutionary Algorithms.- 5. Perspectives on Adaptive Scheduling..- 6. Population Flow in Adaptive Scheduling.- 7. Adaptation of Structured Populations.- 8. A Computational Study.- 9. Conclusions and Outlook.- References.
204 citations
TL;DR: Techniques that aim at reducing the effective size of the search space to be explored in order to find a satisfactory solution by judiciously selecting the order in which variables are instantiated and the sequence in which possible values are tried for each variable are discussed.
188 citations
TL;DR: In this paper, the authors compare and discuss the concepts of WLC and expose the assumptions of stationarity implied in the workload norms, which make demands upon the job release function, and provide guidelines for developing production control concepts for job shops working under dynamic circumstances.
164 citations
TL;DR: An algorithm based on constraint satisfaction techniques to handle the multiple capacitated job shop scheduling problem effectively is presented and it is shown that the algorithm performs well for both sets of instances.
132 citations
Book•
18 Mar 1996
TL;DR: This paper presents a meta-modelling framework for adaptive scheduling that automates the very labor-intensive and therefore time-heavy and expensive process of manually cataloging and scheduling populations.
Abstract: 1. Introduction.- 2. Job Shop Scheduling.- 3. Local Search Techniques.- 4. Evolutionary Algorithms.- 5. Perspectives on Adaptive Scheduling..- 6. Population Flow in Adaptive Scheduling.- 7. Adaptation of Structured Populations.- 8. A Computational Study.- 9. Conclusions and Outlook.- References.
127 citations
TL;DR: In this paper, a branch and bound algorithm is presented for a very general scheduling problem withn jobs andm machines, where each job consists of a set of operations and each operation has to be processed on a dedicated machine.
Abstract: A branch & bound algorithm is presented for a very general scheduling problem withn jobs andm machines. Each job consists of a set of operations. Each operation has to be processed on a dedicated machine. There may be arbitrary precedence relations between the operations. The set of all operations is partitioned into groups. If on a machine an operation belonging to groupG
g is processed immediately after an operation belonging to groupG
f there is a setup ofs
fg time units. We assume thats
fg=0 iff=g and that thes
fg satisfy the triangle inequality. Computational results for this general problem as well as for special cases like the job-shop problem and the open-shop problem are reported.
01 Jun 1996
TL;DR: In this paper, formulations for deadlock-free schedules are proposed and the importance of considering both material handling and buffer space availability while scheduling such an automated workstation are discussed.
Abstract: Scheduling automated, unmanned manufacturing systems is significantly different from traditional job shops where human presence is implicitly assumed. Deadlocking has been identified as one of the critical problem in the control of automated manufacturing systems. Past approaches have been myopic in the sense that deadlock avoidance and recovery have been treated as run time problems of the system. In this paper, formulations for deadlock-free schedules are proposed and the importance of considering both material handling and buffer space availability while scheduling such an automated workstation are discussed. Extensions to the basic model and solution methods are also presented.
TL;DR: In this paper, the authors discuss job shop scheduling from the viewpoint of dealing with fuzziness inherent in the problem and present a branch-and-bound algorithm for solving static and dynamic problems with fuzzy information.
TL;DR: In this article, the authors considered the problem of job-shop and flow-shop scheduling with two machines, no more than two operations per job, and Time Lags, i.e., a minimum time interval between the completion time of the first operation and the starting time of a second one.
Abstract: We consider Job-Shop and Flow-Shop scheduling problems with two machines, no more than two operations per job, and Time Lags, i.e., a minimum time interval between the completion time of the first operation and the starting time of the second one. We give complexity results for the preemptive and nonpreemptive cases and study the relationship between the two problems. For the Flow-Shop problem we give lower bounds and upper bounds and analyze their worst-case performances. Finally we define a Tabu Search algorithm and prove the effectiveness of the proposed bounds through extensive computational results.
TL;DR: In this paper, the authors used Data Envelopment Analysis (DEA) to measure multiple performance criteria for 42 dispatching rules in a job shop environment and evaluated the efficiency of each dispatching rule relative to the other rules.
Abstract: This paper uses Data Envelopment Analysis (DEA) to measure multiple performance criteria for 42 dispatching rules in a job shop environment. We introduce a DEA application in production scheduling. Seven performance measures are considered in the evaluation. Without pre-assigning weights to any performance measure, DEA evaluates the efficiency of each dispatching rule relative to the other rules. After running a large number of experiments, the results show that two extreme subgroups of dispatching rules perform consistently. The shortest processing time related rules form the top group, while the longest processing time related rules form the bottom group. The due date or slack-related rules perform well in tardiness. However, they are ranked low if all seven criteria are considered together. The results provide guidance to scheduling practitioners in choosing priority dispatching rules when there are multiple objectives.
TL;DR: It is proved that there is an optimal schedule with the shortest processing time (SPT) job order and a dynamic programming algorithm is derived to find such a schedule and an approximation algorithm based on the shortest path algorithm and the SPT job order is proposed to solve the problem.
Abstract: This paper considers a reentrant job shop with one hub machine which a job enters K times. Between any two consecutive entries into the hub, the job is processed on other machines. The objective is to minimize the total flow time. Under two key assumptions, the bottleneck assumption and the hereditary order (HO) assumption on the processing times of the entries, it is proved that there is an optimal schedule with the shortest processing time (SPT) job order and a dynamic programming algorithm is derived to find such a schedule. An approximation algorithm based on the shortest path algorithm and the SPT job order is also proposed to solve the problem. The approximation algorithm finds an optimal clustered schedule. In clustered schedules, jobs are scheduled in disjoint clusters; they resemble batch processing and seem to be of practical importance. Worst-case bounds for clustered schedules are proved with the HO assumption relaxed. Two special cases with the restriction that there are only two entries to t...
TL;DR: Results indicate that VCM yields significantly better flow time and due date performance over a wide range of common operating conditions, as well as being more robust to demand variability.
Abstract: In this paper, Virtual Cellular Manufacturing (VCM), an alternative approach to implementing cellular manufacturing, is investigated. VCM combines the setup efficiency typically obtained by Group Technology (GT) cellular manufacturing (CM) systems with the routing flexibility of a job shop. Unlike traditional CM systems in which the shop is physically designed as a series of cells, family-based scheduling criteria are used to form logical cells within a shop using a process layout. The result is the formation of temporary, virtual cells as opposed to the more traditional, permanent, physical cells present in GT systems. Virtual cells allow the shop to be more responsive to changes in demand and workload patterns. Production using VCM is compared to production using traditional cellular and job shop approaches. Results indicate that VCM yields significantly better flow time and due date performance over a wide range of common operating conditions, as well as being more robust to demand variability.
21 May 1996
TL;DR: The paper presents SIMULEX, a prototype decision support system for short-term rescheduling in manufacturing that allows multi-attribute decisions under uncertainty and focuses on the system's decision model.
Abstract: Knowledge-based systems can help to enlarge the application range for simulation. Acting as intelligent front-ends they communicate with the user and provide statistical knowledge. As an example, the paper presents SIMULEX, a prototype decision support system for short-term rescheduling in manufacturing. SIMULEX couples expert systems and simulation to assist the production manager in handling production disturbances. Its core is a job shop simulator that models the plant and evaluates the results of various rescheduling measures. One intelligent front-end (the access system) gathers information about the disturbance and configures the simulation experiments. Another (the run time control) supervises the simulation runs. A third one (the termination/interpretation system) analyzes the data, derives conclusions and suggests the most promising measures. The paper focuses on the system's decision model that allows multi-attribute decisions under uncertainty.
TL;DR: This paper develops a method that determines the earliest possible completion time of any arriving job, without sacrificing the delivery performance of any other job in the shop, and thereby determines a workload-dependent planned lead time.
TL;DR: This paper examines several extensions of the shifting bottleneck procedure towards real-life applications and compares it with priority dispatching rules on a set of large test problems.
TL;DR: A virtual cellular manufacturing approach to implementing cellular manufacturing systems that combines the set‐up efficiency typically obtained by traditional cellular manufacturing or group technology systems with the flexibility of a job shop is proposed.
Abstract: Proposes a virtual cellular manufacturing approach to implementing cellular manufacturing systems that combines the set‐up efficiency typically obtained by traditional cellular manufacturing or group technology systems with the flexibility of a job shop. Unlike traditional cellular systems in which the shop is physically designed as a series of cells, cells are formed within a shop utilizing a process layout using scheduling mechanisms. The result is the formation of cells that are temporary and logical (virtual) in nature, allowing them to be more responsive to changes in demand patterns. Simulation runs comparing this approach to production using traditional cellular and job shop approaches indicate that this new approach yields significantly better shop performance over a range of operating conditions.
TL;DR: In this article, the authors exploit the structure of the routings in semiconductor testing to develop tailored decomposition procedures that decompose the shop into a number of work centers that are scheduled using specialized procedures.
Abstract: We present decomposition procedures for scheduling semiconductor testing facilities. These facilities are characterized by the presence of different types of work centers, some of which have sequence-dependent setup times and some parallel identical machines. We exploit the structure of the routings in semiconductor testing to develop tailored decomposition procedures that decompose the shop into a number of work centers that are scheduled using specialized procedures. Extensive computational experiments show that these procedures significantly outperform existing methods in reasonable CPU times. These results indicate that decomposition methods can be successfully applied to complex scheduling problems of the type addressed in this paper, as well as the classical job shop problems addressed in previous research.
TL;DR: The findings of the study suggest that the primary determinants of tardiness-based criteria are problem characteristics, and both the regression analysis and the analysis of variance provide strong evidence of the strategy-effect.
Abstract: The literature on job scheduling recognizes the importance of due date performance criteria such as mean tardiness and maximum tardiness. A number of studies test a large number of sequencing rules for these criteria in job shop and flow shop settings. The object of this present research is to examine the performance of some well-known priority rules in a flow shop with multiple processors. This study investigates the performance of ten priority rules in terms of mean and maximum tardiness. It examines the effects of problem characteristics, such as number of jobs, number of machines stages and number of parallel processors at each stage, and the performance of priority rules using regression analysis. The findings of the study suggest that the primary determinants of tardiness-based criteria are problem characteristics. In addition, both the regression analysis and the analysis of variance provide strong evidence of the strategy-effect. Finally, a detailed performance review of examined priority...
TL;DR: For problems with makespan, (weighted) mean flow time, weighted number of tardy tasks, and sum of tardiness as objective functions polynomial time algorithms are presented.
TL;DR: In this article, the authors extended the work of Treleven by reviewing the literature on scheduling in job shops constrained by more than one resource and comparing the scheduling research in auxiliary resource-constrained job shops with that of labour-constructed job shops.
Abstract: Over the past several years, a number of survey, classification, and review articles have focused on scheduling research in machine [only] constrained job shops. Barring the work of Treleven (1989), there is no reported research that presents a detailed review of the issues related to scheduling and sequencing in job shops with multiple resource constraints. In his article, Treleven reviewed the research in job shops constrained by machines and labour. Job shops are not only constrained by machines and labour, but by auxiliary resources (in the form of tooling, etc.) as well. This paper extends the work of Treleven by reviewing the literature on scheduling in job shops constrained by more than one resource and comparing the scheduling research in auxiliary resource-constrained job shops with that of labour-constrained job shops. In addition, this article raises some issues for future scheduling research in multiple resource-constrained job shops.
TL;DR: It is found that in stochastic dynamic job shops, the number of lot splits is more important than the exact form of splitting, but when optimal job sizes are determined for each scenario, there are a few circumstances where the implementation of a small initial split can provide measurable improvement in flow time performance.
Abstract: In recent years many firms have been implementing small lot size production. Lot splitting breaks large orders into smaller transfer lots and offers the ability to move parts more quickly through the production process. This paper extends the deterministic studies by investigating various lot splitting policies in both stochastic job shop and stochastic flow shop settings using performance measures of mean flow time and the standard deviation of flow time. Using a computer simulation experiment, we found that in stochastic dynamic job shops, the number of lot splits is more important than the exact form of splitting. However, when optimal job sizes are determined for each scenario, we found a few circumstances where the implementation of a small initial split, called a “flag,” can provide measurable improvement in flow time performance. Interestingly, the vast majority of previous research indicates that methods other than equal lot splitting typically improves makespan performance. The earlier research, however, has been set in the static, deterministic flow shop environment. Thus, our results are of practical interest since they show that the specific method of lot splitting is important in only a small set of realistic environments while the choice of an appropriate number of splits is typically more important.
11 Dec 1996
TL;DR: A new encoding scheme in genetic algorithms is proposed by using an ordering string for the classic job shop scheduling problem, which naturally overcomes the infeasibility problem in genetic iterations.
Abstract: A new encoding scheme in genetic algorithms is proposed by using an ordering string for the classic job shop scheduling problem. A genetic algorithm is designed for searching the semi-active schedule space, which is encoded by the string space. A new crossover, set-partition crossover is introduced in accompanying the genetic searching. An associated selection strategy and a production structure are properly established for this fashion of encoding. This encoding scheme naturally overcomes the infeasibility problem in genetic iterations. Experiments show that the proposed genetic algorithm is effective, and optimal solutions are attainable in some probability for Fisher and Thompson problems with definite hardness.
TL;DR: Extensive computational experiments show that for problems with balanced workloads and random routeings simple MCMs and SSPs can be used without affecting solution quality.
Abstract: We examine the effects of different machine criticality measures (MCMs) and subproblem solution procedures (SSPs) on the performance of Shifting Bottleneck (SB) methods for the problem of minimizing maximum lateness in a job shop. Extensive computational experiments show that for problems with balanced workloads and random routeings simple MCMs and SSPs can be used without affecting solution quality. Routeing structure affects the performance of the SB method significantly. We also find that, contrary to some previous studies, the problem of maintaining feasibility in the SB method is significant.
01 Dec 1996
TL;DR: It is proved that the single machine scheduling problem studied to improve the efficiency of an automated medical laboratory is nonpolynomial (NP)-complete and three heuristics for large size problems and a branch and bound based algorithm for small size problems are proposed.
Abstract: We consider a single machine scheduling problem which we studied to improve the efficiency of an automated medical laboratory. In this problem, there are not only chain structured precedence constraints, but also minimal and maximal times separating successive jobs in the same chain (separation time windows). The criterion to be minimized is the makespan. Potential applications are not restricted to medical analysis. This problem often arises in systems where chemical processes are involved. Therefore the problem studied in this paper is important in practice. We prove that the problem is nonpolynomial (NP)-complete. As a consequence, we propose three heuristics for large size problems and a branch and bound based algorithm for small size problems. Computational results are reported.
TL;DR: In this article, a nine-step design procedure is presented for a robust job shop manufacturing system under a constraint using computer simulation experiments in this study, which is based on the Taguchi's concept and the response surface methodology.