185,190 Hits in 5.6 sec

A review of literature on parallel constraint solving

2018 Theory and Practice of Logic Programming  
We review the literature, and see that we can sometimes do quite well, some of the time, on some instances, but we are far from a general solution.  ...  Researchers need to address a number of issues to exploit parallelism, such as: investigating which constraint algorithms are amenable to parallelisation; whether to use shared memory or distributed computation  ...  Acknowledgements We thank Christopher Jefferson for a number of useful discussions, and the reviewers of this journal for their suggestions, which greatly improved this paper.  ... 
doi:10.1017/s1471068418000340 fatcat:42hcmkwlgnayhkmn7w7ypzeh3m

A Review of Literature on Parallel Constraint Solving [article]

Ian P. Gent and Ciaran McCreesh and Ian Miguel and Neil C.A. Moore and Peter Nightingale and Patrick Prosser and Chris Unsworth
2018 arXiv   pre-print
We review the literature, and see that we can sometimes do quite well, some of the time, on some instances, but we are far from a general solution.  ...  Researchers need to address a number of issues to exploit parallelism, such as: investigating which constraint algorithms are amenable to parallelisation; whether to use shared memory or distributed computation  ...  Acknowledgements We thank Christopher Jefferson for a number of useful discussions. We thank reviewers of this journal for their suggestions which greatly improved this paper.  ... 
arXiv:1803.10981v1 fatcat:ramac3tqfrephdxq7gca3tglei

Past and present (and future) of parallel and distributed computation in (constraint) logic programming

2018 Theory and Practice of Logic Programming  
Declarative languages offer unprecedented opportunities for the use of parallelism to speed up execution.  ...  The potential for transparent exploitation of parallelism in logic programming emerged almost immediately with the birth of the paradigm (Pollard 1981).  ...  The paper by Gent, McCreesh, Miguel, Moore, Nightingale, Prosser, and Unsworth, titled A Review of Literature on Parallel Constraint Solving, provides a thorough review of the techniques explored to parallelize  ... 
doi:10.1017/s1471068418000406 fatcat:fzevnnrn5bg6pmevaykleqkxxi

A Genetic Algorithm for the Parallel Machine Scheduling Problem with Consumable Resources

Fayçal Belkaid, Zaki Sari, Mehdi Souier
2013 International Journal of Applied Metaheuristic Computing  
The arrival of each component is represented by a curve-shaped staircase.  ...  In this paper, the authors' interest is focused on the scheduling problem on identical parallel machines with consumable resources in order to minimize the makespan criterion.  ...  The objective of this paper is to implement a genetic algorithm which is the most common kind of metaheuristics for scheduling a set of jobs on identical parallel machines with consumable resources to  ... 
doi:10.4018/jamc.2013040102 fatcat:oom4kmik7vferaeuuukzknqcae

An extensive and systematic literature review for hybrid flowshop scheduling problems

Murat Çolak, Gülşen Aydın Keskin
2022 International Journal of Industrial Engineering Computations  
In the HFSP, a series of jobs are processed respectively in a set of stages that at least one of these stages has more than one parallel machine (identical, uniform or unrelated).  ...  These articles have been statistically analyzed according to many features such as year, country, journal, number of stages, type of parallel machines, constraints, objective functions, solution methods  ...  In this study, a more systematic, extensive, and updated review study compared to existing review papers in the literature has been realized for HFSP.  ... 
doi:10.5267/j.ijiec.2021.12.001 fatcat:hfmfq3h73femphrdw4wgpedsfq

The Chance-Constrained Programming for the Lot-Sizing Problem with Stochastic Demand on Parallel Machines

S. Chotayakul, V. Punyangarm
2016 International Journal of Modeling and Optimization  
The stochastic constraints are transformed into equivalent deterministic programming ones by using the chance constrained programming approach and then obtain an optimal solution by deterministic mixed-integer  ...  The problem is formulated as a stochastic mixed-integer linear programming model. The demand will be assumed to be a normal distribution.  ...  In Section II, we provide a literature review on lot-sizing problems on parallel machines.  ... 
doi:10.7763/ijmo.2016.v6.503 fatcat:vdobmdvuh5f6xivhjx5wiyitje

An effective heuristic for flexible job-shop scheduling problem with maintenance activities

Shijin Wang, Jianbo Yu
2010 Computers & industrial engineering  
Moreover, two cases of maintenance resource constraint are considered: sufficient maintenance resource available or only one maintenance resource available.  ...  With a modified branching scheme, the machine availability constraint and maintenance resource constraint can be easily incorporated into the proposed algorithm.  ...  Firstly, most existing literature focus on the problem of integrating production scheduling with preventive maintenance activities in the context of single machine, parallel machine and flow shop (especially  ... 
doi:10.1016/j.cie.2010.05.016 fatcat:2bfx2nc43rawfplfiqbezr5nei

Bir Uygulama: Bir Beyaz Eşya Üretim Firmasının Boyahane Bölümünde Paralel Makineler için Sıraya Bağlı Kurulum Sürelerini içeren bir Model

Selin KASIMOĞLU, Gülce DEMİR, Berrak Pınar YAZ, Durdu Hakan UTKU
2020 Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi  
One of the ways of coping with the inventory problems in the mass production lines is to achieve and implement a detailed production schedule.  ...  Excessive buffer inventory may disrupt production and constitute one of the main problems.  ...  Literature Review Scheduling with multiple criteria is one of the most attractive topics for researchers.  ... 
doi:10.47495/okufbed.779834 fatcat:77cefnjbzna3zpnrlvrtekiiyi

Due-date assignment with asymmetric earliness–tardiness cost

G Mosheiov
2003 Journal of the Operational Research Society  
The due-date assignment part of MWAL for a given sequence has been shown in the literature to be solved on a single machine in O(n’) time.  ...  This problem of mini- mizing the maximal weighted absolute lateness (known in the literature as MWAL) was first studied by Li and Cheng, ' and in their recent review, Gordon er a’ mention it as one of  ... 
doi:10.1057/palgrave.jors.2601624 fatcat:7g4w6w4torendeggrhf77ykkkm

Fundamentals and recent developments in stochastic unit commitment

Martin Håberg
2019 International Journal of Electrical Power & Energy Systems  
It also provides a survey of the latest research on stochastic unit commitment, including an in-depth review of selected important recent advances in decomposition based methods.  ...  A B S T R A C T Optimal scheduling of power generating units must take into account possibilities of forecast errors and equipment failure.  ...  This article does not attempt to duplicate the efforts of earlier reviewers by exhaustively surveying all available literature on unit commitment under uncertainty, but includes a synopsis of the fundamental  ... 
doi:10.1016/j.ijepes.2019.01.037 fatcat:dbq7xl27jne6fkitg576ke34tu

Page 5367 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
This methodology is illustrated by solving a number of synchronization problems from the literature.” 68Q Theory of computing 94i:68088 94i:68086 68Q10 68Q22 Wei, Jiawang (D-KLRH-GM; Karlsruhe) Parallel  ...  Each ranker in this hierarchy is best suited to solve a particular class of synchronization problems and together the four rankers are sufficient for solving most synchro- nization problems in the literature  ... 

Research Trends and Outlooks in Assembly Line Balancing Problems

Parames Chutima
2020 Engineering Journal  
Before proceeding a comprehensive literature review, the ineffectiveness of the previous ALBP classification structures is discussed and a new classification scheme based on the layout configurations of  ...  This paper presents the findings from the survey of articles published on the assembly line balancing problems (ALBPs) during 2014-2018.  ...  In section 2, the new classification scheme in reviewing the ALBPs is proposed. Sections 3 -9 provide literature reviews on the ALBP based on their different layout configurations.  ... 
doi:10.4186/ej.2020.24.5.93 fatcat:6orjxdvionbapjhifvogdzp36y

A Parallel Algorithm for Scheduling a Two-Machine Robotic Cell in Bicycle Frame Welding Process

Andrzej Gnatowski, Teodor Niżyński
2021 Applied Sciences  
The time complexity of the introduced parallel method is O(log2n) on an n3-processor Exclusive Read Exclusive Write Parallel Random-Access Machine (EREW PRAM), where n is the problem size.  ...  To present the benefits of the parallelization, the algorithm is compared to the state of art sequential method and a solver-based approach.  ...  Data Availability Statement: The data presented in this study are available on request from the corresponding author. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/app11178083 fatcat:gldk57patfduvihtagcjc3ippe

A review of scheduling problem and resolution methods in flexible flow shop

Tian-Soon Lee, Ying-Tai Loong
2019 International Journal of Industrial Engineering Computations  
This review paper gives a comprehensive exploration review on the FFS scheduling problem and guides the reader by considering and understanding different environmental assumptions, system constraints and  ...  The Flexible flow shop (FFS) is defined as a multi-stage flow shops with multiple parallel machines.  ...  Acknowledgment The authors would like to thank the reviewers for their constructive comments and the Ministry of Higher  ... 
doi:10.5267/j.ijiec.2018.4.001 fatcat:kiq2jjjsmzgtpoaudrq4qc7ndi

Lagrangian approach to minimize makespan of non-identical parallel batch processing machines

Nurul Suhaimi, Christine Nguyen, Purushothaman Damodaran
2016 Computers & industrial engineering  
This research focuses on minimizing the makespan of a set of non-identical parallel batch processing machines. In order to schedule jobs on these machines, two decisions are to be made.  ...  Two sets of constraints were relaxed to consider two Lagrangian Relaxation models. Experiments were conducted with data sets from the literature.  ...  Potts and Kovalyov [1] reviewed the literature on scheduling with batching 8 decisions.  ... 
doi:10.1016/j.cie.2016.09.018 fatcat:pzz5j3zxozasvp2bracq77g4kq
« Previous Showing results 1 — 15 out of 185,190 results