Filters








3,893 Hits in 6.3 sec

Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: Development and computational evaluation of a parallel branch-and-price algorithm

Gerhard Rauchecker, Guido Schryen
2019 Computers & Operations Research  
We address this gap by (1) adapting an exact branch-and-price algorithm to a parallel machine scheduling problem on unrelated machines with sequence-and machine-dependent setup times, (2) parallelizing  ...  the adapted algorithm by implementing a distributed-memory parallelization with a master/worker approach, and (3) conducting extensive computational experiments using up to 960 MPI processes on a modern  ...  Simulations were performed with computing resources granted by RWTH Aachen University under project prep0011.  ... 
doi:10.1016/j.cor.2018.12.020 fatcat:innlyhuuurbxjplm65tkvstt2y

High-Performance Computing for Scheduling Decision Support: A Parallel Depth-First Search Heuristic [article]

Gerhard Rauchecker, Guido Schryen
2016 arXiv   pre-print
For scheduling problems with setup times on unrelated parallel machines, there is limited research on solution methods and to the best of our knowledge, parallel computer architectures have not yet been  ...  Since many scheduling problems are NP-hard in the strong sense, there is a need for developing solution heuristics.  ...  machines with sequence-(but not machine-) dependent setup times, release dates, due dates, and a total weighted tardiness objective function.  ... 
arXiv:1605.04682v1 fatcat:pvzpcgq5yzhkhdo5ogti2d4z4m

Recent trends in sequencing and scheduling

Manisha Sharma, Himansha Sharma, Meenakshi Sharma
2018 Malaya Journal of Matematik  
Directions for future research are also provided in present paper scenario along with objective of creating bridge between theory and practical use of different types of sequencing and scheduling in the  ...  Here various categories of scheduling and sequencing models are identified.  ...  This algorithm out performs results given by Branch and Bound algorithms. ) Eren, (2010) used a bi-criteria m-machine flow shop scheduling problem with sequence dependent setup times with minimization  ... 
doi:10.26637/mjm0s01/14 fatcat:x4nj7acjbzcxzn7pu47xm6nyii

Page 698 of The Journal of the Operational Research Society Vol. 56, Issue 6 [page]

2005 The Journal of the Operational Research Society  
A branch-and-bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times.  ...  Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. J Op! Res Soc 53: 895-906. Glover F (1989). Tabu search—Part I.  ... 

A multi objective volleyball premier league algorithm for green scheduling identical parallel machines with splitting jobs

Khodakaram Salimifard, Jingpeng Li, Davood Mohammadi, Reza Moghdani
2020 Applied intelligence (Boston)  
This paper proposes a mathematical model for scheduling parallel machines with splitting jobs and resource constraints.  ...  In this paper, a novel Multi-Objective Volleyball Premier League (MOVPL) algorithm is presented for solving the aforementioned problem.  ...  Shim and Kim [38] proposed a branch and bound algorithm to schedule jobs composed of some unit jobs considering independent setup times on parallel machines.  ... 
doi:10.1007/s10489-020-02027-1 fatcat:5ptss32qkbetzich5j6cw7gu4m

Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times

J-G Kim, D-H Lee
2009 Journal of the Operational Research Society  
A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time. Comput Opns Res 31: 1727-1751. Shabtay D (2006).  ...  Kim S-I, Choi H-S and Lee D-H (2007). Scheduling algorithms for parallel machines with sequence-dependent setup and distinct ready times: minimizing total tardiness.  ... 
doi:10.1057/jors.2008.95 fatcat:x7pbtn2z4nagpflzhmhdwmv7ae

Scheduling with Setup Considerations: An MIP Approach [chapter]

Mohamed. K., Siew C., Yasothei Suppiah
2007 Multiprocessor Scheduling, Theory and Applications  
Hall and Posner [1991] solved the weighted version of the problem with no setup times. Azizoglu and Webster [1997] introduced a branch-and-bound algorithm to solve the problem with setup times.  ...  Figure 2 . 2 for 10J 2 F single machine fixed setup timesFigure 3. for 10J 2 F single machine variable setup times Figure 4 . 4 for 10J 2 F parallel machines fixed setup times Figure 5. for 10J 2 F parallel  ...  This volume contains four major parts that cover the following directions: the state of the art in theory and algorithms for classical and non-standard scheduling problems; new exact optimization algorithms  ... 
doi:10.5772/5225 fatcat:luwmm6sqvvgidbp4azuw24hr6e

Lot Sizing and Scheduling in Parallel Uniform Machines – A Case Study [chapter]

F. Charrua, Francisco Brojo, Pedro M.
2012 Simulated Annealing - Advances, Applications and Hybridizations  
Introduction This chapter presents the problem of scheduling tasks in uniform parallel machines with sequence-dependent setup times.  ...  Given the research done, the problem of sequencing and lot sizing in uniform parallel machines, with penalties for failure to meet delivery deadlines, setup times depend on the sequence and width restrictions  ...  It should be emphasized that in the analysed industrial environments, the methodology used for lot sizing and scheduling is very close to the heuristic applied to generate the initial solution in the presented  ... 
doi:10.5772/50975 fatcat:bkgrmblprfba3cujbersntpqfa

No-Wait Flexible Flow Shop Scheduling with Due Windows

Rong-Hwa Huang, Chang-Lin Yang, Shang-Chia Liu
2015 Mathematical Problems in Engineering  
Setup time must also be considered. Just-in-time (JIT) production is very popular in industry, and timely delivery is important to customer satisfaction.  ...  Therefore, it is essential to consider the time window constraint, which is also very complex. This study focuses on a no-wait FSMP problem with time window constraint.  ...  machines with sequence-dependent setup times.  ... 
doi:10.1155/2015/456719 fatcat:jp2efmllr5gfjfz76cpqh2edqy

Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times

C Gagné, W L Price, M Gravel
2002 Journal of the Operational Research Society  
Figure 1 The ACO algorithm for the single machine scheduling total tardiness minimization problem with sequence-dependent setup times.  ...  Scheduling with sequence-dependent setup times Adding the characteristic of sequence-dependent setup times increases the difficulty of the problem of minimizing total tardiness on a single machine.  ... 
doi:10.1057/palgrave.jors.2601390 fatcat:qyx6os75d5bo7b5al36pimgsdy

Scheduling reentrant jobs on parallel machines with a remote server

K. Chakhlevitch, C.A. Glass
2009 Computers & Operations Research  
Glass et al. [6] analyzed scheduling problems in the environment with parallel dedicated machines and a single server.  ...  In our scenario, the setup operations for jobs are performed on a remote or external server, i.e. no machine is tied up by setup operation of a particular job and each machine is available at any time  ...  We would like to thank Graeme Jardine, Peter Sadd and Andy Walker of Premier Analytical Services for their cooperation and for providing data for computational experiments.  ... 
doi:10.1016/j.cor.2008.11.007 fatcat:fz7r62rtkjgl5ckbexykyq4bqe

An exact branch-and-price algorithm for scheduling rescue units during disaster response

Gerhard Rauchecker, Guido Schryen
2019 European Journal of Operational Research  
This performance of our branch-and-price algorithm enables rescue organizations to apply our procedure in practice, even when the time for decision making is limited to a few minutes.  ...  OR in disaster relief Disaster operations management Scheduling Branch-and-price, a b s t r a c t In disaster operations management, a challenging task for rescue organizations occurs when they have to  ...  Supplementary material Supplementary material associated with this article can be found, in the online version, at doi: 10.1016/j.ejor.2018.06.010 .  ... 
doi:10.1016/j.ejor.2018.06.010 fatcat:xlbvtoniqrdtfgzq3uhryig3bm

A new mathematical model for integrated production planning and scheduling problem in capacitated flexible flow shop with sequence-dependent setups

Reza Ramezanian, Sahar Fallah Sanami, Vahid Mahmoodian
2017 Scientia Iranica. International Journal of Science and Technology  
The main contribution and novelty of this paper is proposing a more e cient mathematical model for integrated lot-sizing and scheduling in a multi-product multiperiod capacitated exible ow shop with sequence-dependent  ...  KEYWORDS Lot-sizing and scheduling; Flexible ow shop; Mathematical model; Sequence-dependent setup; MIP-based method; Fix-and-relax procedure. Abstract.  ...  up of a certain item incurs a setup time and relevant setup cost and it is sequence-dependent.  ... 
doi:10.24200/sci.2017.4389 fatcat:jj2eppgbznhz7p2h5aa5dxitzi

Job Shop Scheduling With Flexible Energy Prices

Maximilian Selmair, Thorsten Claus, Marco Trost, Andreas Bley, Frank Herrmann
2016 ECMS 2016 Proceedings edited by Thorsten Claus, Frank Herrmann, Michael Manitz, Oliver Rose  
In this paper, we develop a scheduling method as a linear optimization model with the objective to minimize energy costs in a job shop production system.  ...  The rising energy prices -particularly over the last decade -pose a new challenge for the manufacturing industry.  ...  The same applies for setup processes. 3) Every job contains operations in a linear sequence.  ... 
doi:10.7148/2016-0488 dblp:conf/ecms/SelmairCTBH16 fatcat:wspmq5yjkzh3fonetia4rulfgy

Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals

Ridvan Gedik, Chase Rainwater, Heather Nachtmann, Ed A. Pohl
2016 European Journal of Operational Research  
dependent setup times on unrelated parallel machines in a fixed planning horizon.  ...  In this study, we propose constraint programming (CP) model and logic-based Benders algorithms in order to make the best decisions for scheduling non-identical jobs with availability intervals and sequence  ...  The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing the official policies, either expressed or implied, of the U.S.  ... 
doi:10.1016/j.ejor.2015.11.020 fatcat:ycrr34xn2vgjnjvfwhitidvexy
« Previous Showing results 1 — 15 out of 3,893 results