scispace - formally typeset
Journal ArticleDOI

Ordering scheduling problem in manufacturing systems

R. Conterno, +1 more
- 01 Sep 1988 - 
- Vol. 26, Iss: 9, pp 1487-1510
Reads0
Chats0
TLDR
In this paper, the problem of scheduling customer orders in the management of a large multi-product warehouse is addressed under realistic assumptions including rapidly changing data, uncertainties and unforeseen events. Simple flexible solution strategies are sought, in the sense that the scheduling problem should not be solved again from the beginning every time new information becomes available.
Abstract
The problem of scheduling customer orders in the management of a large multi-product warehouse is addressed under realistic assumptions including rapidly changing data, uncertainties and unforeseen events. Simple flexible solution strategies are sought, in the sense that the scheduling problem should not be solved again from the beginning every time new information becomes available. Among the solution strategies, one is based on a few statistical assumptions about the random variables involved in the process: it exploits a stochastic version of the well-known duality principle for nonlinear programming and yields a number of interesting features.

read more

Citations
More filters
Journal ArticleDOI

A practical approach to job-shop scheduling problems

TL;DR: The use of Lagrangian relaxation to schedule job shops, which include multiple machine types, generic precedence constraints, and simple routing considerations, is explored and compares favorably with knowledge-based scheduling.
Journal ArticleDOI

Schedule generation and reconfiguration for parallel machines

TL;DR: An efficient near-optimal algorithm based on Lagrangian relaxation is presented, which provides a lower bound on the cost, which can be used as a measure of suboptimality.
Journal ArticleDOI

Scheduling jobs with simple precedence constraints on parallel machines

TL;DR: The procedure presented is an efficient near-optimal method based on the Lagrangian relaxation technique and the list-scheduling concept that can be used to provide quick answers to what-if questions and to reconfigure the schedule to reincorporate new jobs and other dynamic changes.
Journal ArticleDOI

Imaging Order Scheduling of an Earth Observation Satellite

TL;DR: Numerical results indicate that the imaging order scheduler for FORMOSAT-2 is effective and efficient to generate good imaging plans for realistic problems, and the performance of the solution algorithm significantly depends on the number of jobs, as well as the rewards of order completion.
Journal ArticleDOI

Scheduling flexible flow shops with no setup effects

TL;DR: An efficient, optimization model-based approach for scheduling the production of discrete-part, make-to-order type of flexible flow shops, where setup effects are negligible, which generates near-optimal schedules, provides relatively smooth adjustment for small disturbances, and is computationally efficient.
References
More filters
Journal ArticleDOI

Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources

Hugh Everett
- 01 Jun 1963 - 
TL;DR: The use of Lagrange multipliers for optimization in the presence of constraints is not limited to differentiable functions but can be applied to problems of maximizing an arbitrary real valued objective function over any set whatever, subject to bounds on the values of any other finite collection of real valued functions denned on the same set as mentioned in this paper.
Book ChapterDOI

Lagrangian Relaxation for Integer Programming

TL;DR: It is a pleasure to write this commentary because it offers an opportunity to express my gratitude to several people who helped me in ways that turned out to be essential to the birth of [8].
Journal ArticleDOI

Integer Programming Algorithms: A Framework and State-of-the-Art Survey

TL;DR: A unifying framework is developed to facilitate the understanding of most known computational approaches to integer programming, and a number of currently operational algorithms are related to this framework.
Journal ArticleDOI

Duality in Nonlinear Programming: A Simplified Applications-Oriented Development

A. M. Geoffrion
- 01 Jan 1971 - 
TL;DR: The number of computational or theoretical applications of nonlinear duality theory is small compared to the number of theoretical papers on this subject over the last decade as mentioned in this paper, and this study attempts t...
Journal ArticleDOI

Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I

TL;DR: An algorithm for solving resource-constrained network scheduling problems, a general class of problems that includes the classical job-shop-scheduling problem, that uses Lagrange multipliers to dualize the resource constraints, forming a Lagrangian problem.
Related Papers (5)