Narrow search
Showing 1 - 10 of 8,305
Cover Image
Demand forecast accuracy and performance of inventory policies for multi-level rolling schedule MRP problems.
Jeunet, Jully - Université Paris-Dauphine - 2006
Our incentive is to assess the impact of demand forecast errors on the cost performance of several lot-sizing techniques in a multi-level context. Unpredicted changes in demand keep on plaguing consumer product companies. However, efforts to improve demand forecast accuracy may not be rewarded...
Persistent link: https://www.econbiz.de/10008832181
Cover Image
Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure
Cunha, Jesus O.; Melo, Rafael A. - In: European journal of operational research : EJOR 295 (2021) 3, pp. 874-892
Persistent link: https://www.econbiz.de/10012622413
Cover Image
Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process
Hao, Xinye; Zheng, Li; Li, Na; Zhang, Canrong - In: European journal of operational research : EJOR 303 (2022) 2, pp. 581-592
Persistent link: https://www.econbiz.de/10013363982
Cover Image
Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints
Schnabel, André; Kellenbrink, Carolin; Helber, Stefan - 2017
We consider a novel generalization of the resource-constrained project scheduling problem (RCPSP). Unlike many established approaches for the RCPSP that aim to minimize the makespan of the project for given static capacity constraints, we consider the important real-life aspect that capacity...
Persistent link: https://www.econbiz.de/10011655297
Cover Image
Sequencing Heuristics for Storing and Retrieving Unit Loads in 3d Compact Automated Warehousing Systems
Yu, Yugang - 2011
. Although the sequencing problem is NP-hard some very good heuristics exist. Surprisingly the problem has not yet been … objective to minimize the makespan. We adapt well-known sequencing heuristics for the multi-deep system, and propose and … consistently outperforms all the other heuristics. Generally, it can outperform the benchmark first-come first-served (FCFS …
Persistent link: https://www.econbiz.de/10013128047
Cover Image
Minimizing Makespan in Flowshops with Pallet Requirements : Computational Complexity
Wang, M. W. - 2010
We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...
Persistent link: https://www.econbiz.de/10013152472
Cover Image
Efficient Algorithms for Flexible Job Shop Scheduling with Parallel Machines
Kubiak, Wieslaw - 2020
Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of review. Here we focus on a flexible job shop scheduling problem of minimizing the makespan in a two-center job shop, where the first center consists of one machine and the second...
Persistent link: https://www.econbiz.de/10012838656
Cover Image
A Simple Optimised Search Heuristic for the Job-Shop Scheduling Problem
Fernandes, Susana - 2007
This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times
Persistent link: https://www.econbiz.de/10012775941
Cover Image
Efficient Heuristics for MRP Lot Sizing with Variable Production/Purchasing Costs
Prentis, Eric L. - 2022
Two heuristics based on branch and bound (B&B) are developed to solve closed-loop material requirements planning (MRP …/purchasing costs MRP lot-sizing problem. LAM and TAM are tested on problems and compared to heuristics in the literature. TAM may be …
Persistent link: https://www.econbiz.de/10013290419
Cover Image
A Comparison of Fixed and Dynamic Pricing Policies in Revenue Management
Şen, Alper - 2015
US by 67 percent and 30 percent, respectively. We suggest two simple dynamic heuristic heuristics that continuously … problem. We show through a numerical study that the revenue impact of using these dynamic pricing heuristics rather than fixed … pricing heuristics persist under a periodic setting. This is especially true for the revenue approximation heuristic for which …
Persistent link: https://www.econbiz.de/10013036758