Similar Search Results

Optimality in nesting problems: New constraint programming models and a new global constraint for non-overlap

Cherri, Luiz Henrique; Carravilla, Maria Antónia; … - In: Operations Research Perspectives 6 (2019), pp. 1-19

In two-dimensional nesting problems (irregular packing problems) small pieces with irregular shapes must be packed in large objects. A small number of exact methods have been proposed to solve nesting problems, typically focusing on a single problem variant, the strip packing problem. There are...

Persistent link: https://www.econbiz.de/10012662790

Multi-objective evolutionary search strategies in constraint programming

Bennetto, Robert; van Vuuren, Jan - In: Operations Research Perspectives 8 (2021), pp. 1-15

It has been shown that evolutionary algorithms are able to construct suitable search strategies for classes of Constraint Satisfaction Problems (CSPs) in Constraint Programming. This paper is an explanation of the use of multi-objective optimisation in contrast to simple additive weighting...

Persistent link: https://www.econbiz.de/10012662827

Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics

Hübner, Felix; Gerhards, Patrick; Stürck, Christian; … - In: Journal of Scheduling 24 (2021) 3, pp. 269-290

Scheduling of megaprojects is very challenging because of typical characteristics, such as expected long project durations, many activities with multiple modes, scarce resources, and investment decisions. Furthermore, each megaproject has additional specific characteristics to be considered....

Persistent link: https://www.econbiz.de/10014501546

On the generalization of constraint programming and boolean satisfiability solving techniques to schedule a resource-constrained project consisting of multi-mode jobs

Schnell, Alexander; Hartl, Richard F. - In: Operations Research Perspectives 4 (2017), pp. 1-11

In our paper, we analyze new exact approaches for the multi-mode resource-constrained project scheduling (MRCPSP) problem with the aim of makespan minimization. For the single-mode RCPSP (SRCPSP) recent exact algorithms combine a Branch and Bound algorithm with principles from Constraint...

Persistent link: https://www.econbiz.de/10011825933

A constraint programming-based genetic algorithm for capacity output optimization

Chin, Jeng Feng; Tan, Melissa Chea-Ling - In: Journal of Industrial Engineering and Management (JIEM) 7 (2014) 5, pp. 1222-1249

Purpose: The manuscript presents an investigation into a constraint programming-based genetic algorithm for capacity output optimization in a back-end semiconductor manufacturing company. Design/methodology/approach: In the first stage, constraint programming defining the relationships between...

Persistent link: https://www.econbiz.de/10011939169

Two-agent scheduling in open shops subject to machine availability and eligibility constraints

Su, Ling-Huey; Hsiao, Ming-Chih - In: Journal of Industrial Engineering and Management (JIEM) 8 (2015) 4, pp. 1103-1124

Purpose: The aims of this article are to develop a new mathematical formulation and a new heuristic for the problem of preemptive two-agent scheduling in open shops subject to machine maintenance and eligibility constraints. Design/methodology: Using the ideas of minimum cost flow network and...

Persistent link: https://www.econbiz.de/10011939243

Metaheuristic algorithm for ship routing and scheduling problems with time window

Alhamad, Khaled; Alrashidi, Azizah; Alkharashi, Sameh - In: Cogent Business & Management 6 (2019), pp. 1-16

This paper describes a Tabu Search (TS) heuristic for a Ship Routing and Scheduling Problem (SRSP). The method was …

Persistent link: https://www.econbiz.de/10012117414

The last-mile vehicle routing problem with delivery options

Tilk, Christian; Olkis, Katharina; Irnich, Stefan - In: OR Spectrum 43 (2021) 4, pp. 877-904

carriers’ delivery cost. In the classical vehicle routing problem (VRP) with time windows, each customer request has only one … the vehicle routing problem with delivery options (VRPDO), in which some requests can be shipped to alternative locations …

Persistent link: https://www.econbiz.de/10014497538

Integrated zone picking and vehicle routing operations with restricted intermediate storage

Ostermeier, Manuel; Holzapfel, Andreas; Kuhn, Heinrich; … - In: OR Spectrum 44 (2021) 3, pp. 795-832

processing steps are highly interdependent. The schedule for picking needs to be synchronized with the routing decisions to … storage represents a bottleneck as capacity for order storage is limited. The simultaneous planning of picking and routing … routing problem with restricted intermediate storage. We present a comprehensive model formulation and introduce a general …

Persistent link: https://www.econbiz.de/10014497547

New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot

Diefenbach, Heiko; Emde, Simon; Glock, Christoph H.; … - In: OR Spectrum 44 (2021) 2, pp. 535-573

This paper develops new solution procedures for the order picker routing problem in U-shaped order picking zones with a …

Persistent link: https://www.econbiz.de/10014497603