Narrow search
Showing 1 - 10 of 2,009
Cover Image
A Note on Ending Inventory Valuation in Multiperiod Production Scheduling
van den Heuvel, Wilco; Wagelmans, Albert P.M. - 2002
proposed method outperforms the Wagner-Whitin algorithm and the Silver-Meal heuristic, under several demand patterns, within a …
Persistent link: https://www.econbiz.de/10010324957
Cover Image
Capacity Allocation for Demand of Different Customer-Product-Combinations with Cancellation, No-Shows, and Overbooking When There is a Sequential Delivery of Service
Schütz, Hans-Jörg - 2010
We consider a problem where different classes of customers can book different types of service in advance and the service company has to respond immediately to the booking request confirming or rejecting it. Due to the possibility of cancellations before the day of service, or no-shows at the...
Persistent link: https://www.econbiz.de/10013142776
Cover Image
Efficient Algorithms for Flexible Job Shop Scheduling with Parallel Machines
Kubiak, Wieslaw - 2020
-to-perform approximation algorithm that solves the problem optimally when k=1. A modification of the algorithm provides an optimal solution for … k=2. For k≥3, the algorithm approximates the optimal solution within an absolute worst-case error bound of k−1 …. Surprisingly, this error bound is independent of the number of jobs to be processed. Also and importantly, the proposed algorithm …
Persistent link: https://www.econbiz.de/10012838656
Cover Image
Optimal Design of Timetables to Maximize Schedule Reliability & Minimize Energy Consumption, Rolling Stock and Crew Deployment
Nag, Bodhibrata; Pal, Manabendra Nath - 2013
We have developed a non-linear multi-objective model for optimal design of railway timetables. The objectives of the model are to maximize schedule reliability and minimize energy consumption, rolling stock and crew deployment. Metrics have been derived for each of these objectives. AHP is used...
Persistent link: https://www.econbiz.de/10014153838
Cover Image
A Polynomial Algorithm for Special Case of the One-Machine Scheduling Problem with Time-Lags
Ramalhinho Dias Lourenço, Helena - 2007
-lags, where the time-lags have a chain form, and propose a polynomial algorithm to solve it. The algorithm consist in a polynomial …
Persistent link: https://www.econbiz.de/10014046304
Cover Image
Combinatorial Optimization Using Artificial Bee Colony Algorithm and Particle Swarm Optimization Supported Genetic Algorithm
Önder, Emrah - 2014
Combinatorial optimization problems are usually NP-hard and the solution space of them is very large. Therefore the set of feasible solutions cannot be evaluated one by one. Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) are metaheuristic techniques...
Persistent link: https://www.econbiz.de/10013060468
Cover Image
When queueing is better than push and shove
Gershkov, Alex; Schweinzer, Paul - 2006
We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...
Persistent link: https://www.econbiz.de/10010365886
Cover Image
When Queueing is Better than Push and Shove
Gershkov, Alex - 2009
We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...
Persistent link: https://www.econbiz.de/10012720655
Cover Image
Scheduling with testing
Levi, Retsef; Magnanti, Thomas L.; Shaposhnik, Yaron - In: Management science : journal of the Institute for … 65 (2019) 2, pp. 776-793
Persistent link: https://www.econbiz.de/10012000743
Cover Image
Complexity, bounds and dynamic programming algorithms for single track train scheduling
Harbering, Jonas; Ranade, Abhiram; Schmidt, Marie Elisabeth - In: Operations research for transportation, (pp. 479-500). 2019
Persistent link: https://www.econbiz.de/10012001127