A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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. ... We used shared-memory programming with OpenMP for the parallelization of the pricing problems and the branching decisions. ...arXiv:1605.04682v1 fatcat:pvzpcgq5yzhkhdo5ogti2d4z4m
This paper presents a branch-and-price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. ... The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two-cycle elimination heuristic when solving the pricing ... BRANCH AND PRICE Branch and price (B&P) has been implemented successfully for wide variety of vehicle routing/scheduling problems (Desrochers, Desrosiers, and Solomon  , Desrosiers et al. ...doi:10.1002/nav.20118 fatcat:hqbgvaswnjdxpbmct6lohhb2ym
Hardware dynamically detects opportunities for parallel execution and schedules operations to exploit available resources. ... ILP in a software-centric approach employs a very long instruction word (VLIW) processor and relies on a compiler to statically parallelize and schedule code. ... Statistical compilation An important strategy employed by ILP compilers is the use of statistical information to predict the outcome of conditional branches and improve program optimization and scheduling ...doi:10.1109/2.642817 fatcat:sqa3irdg3zcqzftmok3rpsv65a
This paper presents an exact algorithm for the identical parallel machine scheduling problem over a formulation where each variable is indexed by a pair of jobs and a completion time. ... We show that such a formulation can be handled, in spite of its huge number of variables, through a branch cut and price algorithm enhanced by a number of practical techniques, including a dynamic programming ... Acknowledgments AP, EU and MPA received support from CNPq grants 309004/09-8, 304533/02-5, and 300475/93-4, respectively. EU also received support from FAPERJ grant E-26/100.504/2007. ...doi:10.1007/s12532-010-0019-z fatcat:wn4a6jxzejg5vitbhj75bv6bpa
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 ... Scheduling problems are essential for decision making in many academic disciplines, including operations management, computer science, and information systems. ... Acknowledgments This research has been funded by the Federal Ministry of Education and Research of Germany in 505 the framework of KUBAS (project number 13N13942). ...doi:10.1016/j.cor.2018.12.020 fatcat:innlyhuuurbxjplm65tkvstt2y
Summary: “This paper addresses the problem of finding a feasible schedule of n jobs on m parallel machines, where each job has a deadline and some jobs are preassigned to some machine. ... Summary: “Parallel machine scheduling problems concern the scheduling of n jobs on m machines to minimize some function of the job completion times. ...
We analyze three techniques: dynamic scheduling, speculative execution and basic block enlargement. ... In order to exploit this parallelism, a combination of hardware and software techniques must be applied. ... This is the price to pay for higher performanw. ...doi:10.1145/115952.115981 dblp:conf/isca/MelvinP91 fatcat:3egzyuktezcxnby3mypoufmbqe
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 ... 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. ... Acknowledgments This research has been funded by the Federal Ministry of Education and Research of Germany in the framework of KUBAS (project number 13N13942 ). ...doi:10.1016/j.ejor.2018.06.010 fatcat:xlbvtoniqrdtfgzq3uhryig3bm
We analyze three techniques: dynamic scheduling, speculative execution and basic block enlargement. ... In order to exploit this parallelism, a combination of hardware and software techniques must be applied. ... This is the price to pay for higher performanw. ...doi:10.1145/115953.115981 fatcat:ymryv4rrmffv7p6vmgkcivxb2e
The strongly NP-hard feature of the problem stimulates us to develop branch-and-pricing algorithm to solve it. Firstly, the model is formulated as a set partitioning model. ... This paper is to determine the slab schedule on parallel hot rolling lines with consideration of chain precedence constraints, which restricts the slabs belonging to a chain to be successively processed ... Acknowledgement This research is partly supported by National Natural Science Foundation (Grant No. 71402020, 61374207), National 863 High-Tech Research and Development Program of China (2013AA040704). ...doi:10.2355/isijinternational.54.2837 fatcat:fxvtsoyvjzb5zfixa6vxungfyi
Studies in Computational Intelligence
We address the Identical Parallel Machine Scheduling Problem, one of the most important basic problems in scheduling theory, and some generalizations of it arising from real world situations. ... We survey the current state of the art for the most performing meta-heuristic algorithms for this class of problems, with special emphasis on recent results obtained through Scatter Search. ... Acknowledgements We thank the Ministero dell'Università e della Ricerca (MIUR) Italy, for the support given to this project. Thanks are also due to two anonymous ref- ...doi:10.1007/978-3-540-78985-7_2 fatcat:x76bejgm35hcpnlhmmnx5ihfne
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 ... Scheduling comes in branch of mathematical modeling in which the problems are pre defined, and there are common characteristics that are translated into similar types of constraints. ... the need for improved scheduling. ...doi:10.26637/mjm0s01/14 fatcat:x4nj7acjbzcxzn7pu47xm6nyii
Given a price p(M;) € R* for each machine of type Mj; and a deadline d € R*, we consider the problem of selecting a minimum cost set of machines for which there exists a schedule with make- span at most ... We therefore extend recent work concerning due window scheduling from the single machine case to the parallel machine case. ...
For this strongly NP-hard problem, we develop a branch-and-price algorithm, which solves instances with up to 300 jobs, as compared with CPLEX, which cannot solve instances of 100 jobs. ... We address the tactical fixed job scheduling problem with spread-time constraints. In such a problem, there are a fixed number of classes of machines and a fixed number of groups of jobs. ... Acknowledgements Xiandong Zhang thanks the support of National Natural Science Foundation of China (Projects No. 71171058, No. 70832002 and No. 70971100). ...doi:10.1016/j.cor.2014.02.001 fatcat:nyo22s3gqnfbjo6uo7n3rpbbiq
For this strongly NP-hard problem, we develop a branch-and-price algorithm, which solves instances with up to 300 jobs, as compared with CPLEX, which cannot solve instances of 100 jobs. ... We address the tactical fixed job scheduling problem with spread-time constraints. In such a problem, there are a fixed number of classes of machines and a fixed number of groups of jobs. ... Acknowledgements Xiandong Zhang thanks the support of National Natural Science Foundation of China (Projects No. 71171058, No. 70832002 and No. 70971100). ...arXiv:1402.1881v1 fatcat:37qmilrplzgrvfkmueux6rta4e
« Previous Showing results 1 — 15 out of 21,003 results