An Efficient Relax-and-Solve Heuristic for Open-Shop Scheduling Problem to Minimize Total Weighted Earliness-Tardiness PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download An Efficient Relax-and-Solve Heuristic for Open-Shop Scheduling Problem to Minimize Total Weighted Earliness-Tardiness PDF full book. Access full book title An Efficient Relax-and-Solve Heuristic for Open-Shop Scheduling Problem to Minimize Total Weighted Earliness-Tardiness by Mohammad Mahdi Ahmadian. Download full books in PDF and EPUB format.
Author: Mohammad Mahdi Ahmadian Publisher: ISBN: Category : Languages : en Pages : 0
Book Description
An open-shop scheduling problem to minimize the total weighted earliness-tardiness of job-on-machine operations is studied. Each operation has its own due date, earliness weight and tardiness weight. An efficient relax-and-solve heuristic is developed. A feature that makes the proposed heuristic distinctive from the existing heuristics of this kind is that it operates by iterative relaxation and optimization of a series of sub-problems. Performance of the proposed heuristic is verified on a set of 72 benchmark instances with up to 200 operations, adapted from the literature on a similar job-shop scheduling problem. The heuristic delivers best solutions for nearly 71 % of the instances (i.e., 51 out of 72 instances), including the best solution for all instances with 150 and 200 operations. Its running time is around three minutes, while CLPEX was run for 30 minutes.
Author: Mohammad Mahdi Ahmadian Publisher: ISBN: Category : Languages : en Pages : 0
Book Description
An open-shop scheduling problem to minimize the total weighted earliness-tardiness of job-on-machine operations is studied. Each operation has its own due date, earliness weight and tardiness weight. An efficient relax-and-solve heuristic is developed. A feature that makes the proposed heuristic distinctive from the existing heuristics of this kind is that it operates by iterative relaxation and optimization of a series of sub-problems. Performance of the proposed heuristic is verified on a set of 72 benchmark instances with up to 200 operations, adapted from the literature on a similar job-shop scheduling problem. The heuristic delivers best solutions for nearly 71 % of the instances (i.e., 51 out of 72 instances), including the best solution for all instances with 150 and 200 operations. Its running time is around three minutes, while CLPEX was run for 30 minutes.
Author: Jens Kuhpfahl Publisher: Springer ISBN: 3658102926 Category : Business & Economics Languages : en Pages : 206
Book Description
Jens Kuhpfahl analyzes the job shop scheduling problem with minimizing the total weighted tardiness as objective. First, he provides a suitable graph representation based on a disjunctive graph formulation. Second, several key components of local search procedures are analyzed and enhanced. The resulting outputs of these investigations contribute to the development of a new solution procedure whose performance quality leads to superior computational results.
Author: Christian Artigues Publisher: John Wiley & Sons ISBN: 1118623703 Category : Technology & Engineering Languages : en Pages : 235
Book Description
This title presents a large variety of models and algorithms dedicated to the resource-constrained project scheduling problem (RCPSP), which aims at scheduling at minimal duration a set of activities subject to precedence constraints and limited resource availabilities. In the first part, the standard variant of RCPSP is presented and analyzed as a combinatorial optimization problem. Constraint programming and integer linear programming formulations are given. Relaxations based on these formulations and also on related scheduling problems are presented. Exact methods and heuristics are surveyed. Computational experiments, aiming at providing an empirical insight on the difficulty of the problem, are provided. The second part of the book focuses on several other variants of the RCPSP and on their solution methods. Each variant takes account of real-life characteristics which are not considered in the standard version, such as possible interruptions of activities, production and consumption of resources, cost-based approaches and uncertainty considerations. The last part presents industrial case studies where the RCPSP plays a central part. Applications are presented in various domains such as assembly shop and rolling ingots production scheduling, project management in information technology companies and instruction scheduling for VLIW processor architectures.
Author: Nutthapol Asadathorn Publisher: ISBN: Category : Production control Languages : en Pages : 454
Book Description
Assembly type job-shop scheduling is a generalization of the job-shop scheduling problem to include assembly operations. In the assembly type job-shops scheduling problem, there are n jobs which are to be processed on in workstations and each job has a due date. Each job visits one or more workstations in a predetermined route. The primary difference between this new problem and the classical job-shop problem is that two or more jobs can merge to foul' a new job at a specified workstation, that is job convergence is permitted. This feature cannot be modeled by existing job-shop techniques. In this dissertation, we develop scheduling procedures for the assembly type job-shop with the objective of minimizing total weighted tardiness. Three types of workstations are modeled: single machine, parallel machine, and batch machine. We label this new scheduling procedure as SB. The SB procedure is heuristic in nature and is derived from the shifting bottleneck concept. SB decomposes the assembly type job-shop scheduling problem into several workstation scheduling sub-problems. Various types of techniques are used in developing the scheduling heuristics for these sub-problems including the greedy method, beam search, critical path analysis, local search, and dynamic programming. The performance of SB is validated on a set of test problems and compared with priority rules that are normally used in practice. The results show that SB outperforms the priority rules by an average of 19% - 36% for the test problems. SB is extended to solve scheduling problems with other objectives including minimizing the maximum completion time, minimizing weighted flow time and minimizing maximum weighted lateness. Comparisons with the test problems, indicate that SB outperforms the priority rules for these objectives as well. The SB procedure and its accompanying logic is programmed into an object oriented scheduling system labeled as LEKIN. The LEKIN program includes a standard library of scheduling rules and hence can be used as a platform for the development of new scheduling heuristics. In industrial applications LEKIN allows schedulers to obtain effective machine schedules rapidly. The results from this research allow us to increase shop utilization, improve customer satisfaction, and lower work-in-process inventory without a major capital investment.
Author: Holger H. Hoos Publisher: Morgan Kaufmann ISBN: 1558608729 Category : Business & Economics Languages : en Pages : 678
Book Description
Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems. Offering a systematic treatment of SLS algorithms, this book examines the general concepts and specific instances of SLS algorithms and considers their development, analysis and application.
Author: Mohammad Mahdi Ahmadian
Author: Mohammad Mahdi Ahmadian
Author: Suresh Chand
Author: Suresh Chand
Author: SURESH CHAND AND HANS SCHNEEBERGER
Author: Lay Eng Teoh
Author: Jens Kuhpfahl
Author: Christian Artigues
Author: Nutthapol Asadathorn
Author: 
Author: Holger H. Hoos