Author: Publisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
Minimization of Weighted Tardiness in Job Shops Using Shifting Bottleneck and Tabu Search Procedures
Author: Minimizing Makespan and Total Weighted Tardiness for Job Shop Scheduling Problem Using Shifting Bottleneck Heuristic
Author: Lay Eng TeohA Modified Shifting Bottleneck Approach to Job Shop Scheduling with Sequence Dependent Setups (MSBSS)
Author: Xiaoqing SunPublisher:
ISBN:
Category : Production scheduling
Languages : en
Pages : 270
Book Description
This research addresses the NP-Hard, practical problem of scheduling jobs with release dates, due dates and sequence dependent setups where the scheduling objective is to minimize the weighted sum of squared tardiness. Such a problem is practically relevant due to the fact that there are numerous industrial settings that involve sequence dependent setups. A shifting bottleneck based method (MSBSS) is developed for job shop scheduling with sequence dependent setups, which balances both efficiency and optimality. As a key component of MSBSS, a Lagrangian relaxation based approach (LRSSS) is also developed for single-machine scheduling with sequence dependent setups. Sequence dependent setups are formulated into capacity constraints, then the capacity constraints are relaxed using a Lagrangian multiplier. The primal problem is decomposed into job-level subproblems which are solved optimally and an approximation dual problem is then solved using a sub-gradient technique. The result of the relaxation is a list of jobs sequenced by beginning times that is then improved via a three-way enumeration. Experimental results are compared with EDD (earliest due date), ATCS (apparent tardiness cost with sequence dependent setups), dispatching rules, a 4-way enumeration local search, tabu search, and simulated annealing. The LRSSS approach results in superior solution quality with respect to EDD, ATCS, 4-way enumeration and tabu search results. It has comparable solution quality to the simulated annealing results, but is substantially more efficient. The LRSSS is then extended to job shop scheduling with sequence dependent setups, due dates and release dates. The resulting MSBSS procedure decomposes the job shop scheduling problem into a series of single-machine scheduling problems. Machines are scheduled in order of criticality defined as the marginal contribution of a machine to the objective function. The MSBSS approach is compared with EDD, ATCS, and SIMSET (similar setup times) dispatching rules. The MSBSS approach results in superior solution quality to the results of other dispatching rules. Overall the research has resulted in two efficient scheduling procedures (LRSSS and MSBSS) that fill an important gap in algorithm design dealing with practical, realistically sized scheduling problems.
Exact and Heuristic Scheduling Algorithms
Author: Frank WernerPublisher: MDPI
ISBN: 3039284681
Category : Technology & Engineering
Languages : en
Pages : 200
Book Description
This edited book presents new results in the area of the development of exact and heuristic scheduling algorithms. It contains eight articles accepted for publication for a Special Issue in the journal Algorithms. The book presents new algorithms, e.g., for flow shop, job shop, and parallel machine scheduling problems. The particular articles address subjects such as a heuristic for the routing and scheduling problem with time windows, applied to the automotive industry in Mexico, a heuristic for the blocking job shop problem with tardiness minimization based on new neighborhood structures, fast heuristics for the Euclidean traveling salesman problem or a new mathematical model for the period-aggregated resource leveling problem with variable job duration, and several others.
Job Shop Scheduling with Consideration of Due Dates
Author: Jens KuhpfahlPublisher: 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.
Computer Aided Systems Theory - EUROCAST 2007
Author: Roberto Moreno DíazPublisher: Springer
ISBN: 3540758674
Category : Computers
Languages : en
Pages : 1252
Book Description
This book constitutes the thoroughly refereed post-proceedings of the 11th International Conference on Computer Aided Systems Theory, EUROCAST 2007. Coverage in the 144 revised full papers presented includes formal approaches, computation and simulation in modeling biological systems, intelligent information processing, heuristic problem solving, signal processing architectures, robotics and robotic soccer, cybercars and intelligent vehicles and artificial intelligence components.
Integration of Process Planning and Scheduling
Author: Rakesh Kumar PhandenPublisher: CRC Press
ISBN: 0429664729
Category : Technology & Engineering
Languages : en
Pages : 259
Book Description
Both process planning and scheduling are very important functions of manufacturing, which affect together the cost to manufacture a product and the time to deliver it. This book contains various approaches proposed by researchers to integrate the process planning and scheduling functions of manufacturing under varying configurations of shops. It is useful for both beginners and advanced researchers to understand and formulate the Integration Process Planning and Scheduling (IPPS) problem effectively. Features Covers the basics of both process planning and scheduling Presents nonlinear approaches, closed-loop approaches, as well as distributed approaches Discuss the outfit of IPPS in Industry 4.0 paradigm Includes the benchmarking problems on IPPS Contains nature-algorithms and metaheuristics for performance measurements in IPPS Presents analysis of energy-efficient objective for sustainable manufacturing in IPPS
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Author: Jean-Charles RéginPublisher: Springer
ISBN: 3540246649
Category : Computers
Languages : en
Pages : 429
Book Description
This volume contains the proceedings of the First International Conference on IntegrationofAIandORTechniquesinConstraintProgrammingforCombina- rialOptimisation Problems.This new conferencefollows the seriesof CP-AI-OR International Workshops on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems held in Ferrara (1999), Paderborn (2000), Ashford (2001), Le Croisic (2002), and Montreal (2003). The success of the previous workshops has demonstrated that CP-AI-OR is bec- ing a major forum for exchanging ideas and methodologiesfrom both ?elds. The aim of this new conference is to bring together researchersfrom AI and OR, and to give them the opportunity to show how the integration of techniques from AI and OR can lead to interesting results on large scale and complex problems. The integration of techniques from Arti?cial Intelligence and Operations - search has provided e?ective algorithms for tackling complex and large scale combinatorial problems with signi?cant improvements in terms of e?ciency, scalability and optimality. The bene?t of this integration has been shown in applications such as hoist scheduling, rostering, dynamic scheduling and vehicle routing. At the programming and modelling levels, most constraint languages embed OR techniques to reason about collections of constraints, so-calledglobal constraints. Some languages also provide support for hybridization allowing the programmer to build new integrated algorithms. The resulting multi-paradigm programmingframeworkcombines the ?exibility and modelling facilities of C- straint Programming with the special purpose and e?cient methods from - erations Research
Computational Intelligence and Its Applications
Author: Abdelmalek AminePublisher: Springer
ISBN: 3319897438
Category : Computers
Languages : en
Pages : 676
Book Description
This book constitutes the refereed proceedings of the 6th IFIP TC 5 International Conference on Computational Intelligence and Its Applications, CIIA 2018, held in Oran, Algeria, in May 2018. The 56 full papers presented were carefully reviewed and selected from 202 submissions. They are organized in the following topical sections: data mining and information retrieval; evolutionary computation; machine learning; optimization; planning and scheduling; wireless communication and mobile computing; Internet of Things (IoT) and decision support systems; pattern recognition and image processing; and semantic web services.
Decentralized Scheduling of Discrete Production Systems with Limited Buffers
Author: Zimmermann, OlafPublisher: KIT Scientific Publishing
ISBN: 3731512920
Category :
Languages : en
Pages : 208
Book Description
Modern production systems have become more flexible and agile. For them, a suitable control and planning method is needed. Agent-based systems offer the required characteristics. The contributions of these work are a remodeling of the Shifting Bottleneck heuristic to include limited buffers, the development of a decentralized multi-agent system for production planning, and the adaptation of the heuristic to the agent system. It concludes with evaluations of real-world production systems.