๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Earliness/tardiness production planning approaches with due-window for manufacturing systems

โœ Scribed by Dingwei Wang; Wei Wang


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
300 KB
Volume
34
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

โœฆ Synopsis


AbstractรAlthough the earliness/tardiness production planning approaches for manufacturing systems with due-date have appeared in the literature, in practice, customers prefer a time duration rather than an exact due-date. This kind of due-date is called due-window. This paper focuses on the production planning problems to minimize the total earliness and tardiness penalties with a due-window subject to the manufacturing resource constraints. Two models, one for mass manufacture and another for oneof-a-kind product (OKP) manufacture, are discussed separately. By means of mathematical deduction, the model for mass manufacture is translated into a linear programming problem and solved by a simplex method. In the case of OKP manufacture, the problem is reduced to a linear 0ยฑ1 programming model, using the elaborate deยฎnition of variables. The computational results show that both algorithms achieve the optimal production planning and are applicable to practical manufacturing systems.


๐Ÿ“œ SIMILAR VOLUMES


A semi-infinite programming model for ea
โœ Y Li; D Wang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 733 KB

To describe the earlings/tardincss production planning problems in the JIT environment, a nonlinear semi-infinite programming model was proposed in [I]. Due to a nonconvex objective function and infinitely many constraints, the model is difficult to solve by traditional methods. In this paper, simul

A moving block heuristic for minimizing
โœ Scott J. Mason; Song Jin; Jagadish Jampani ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Society of Manufacturing Engineers ๐ŸŒ English โš– 1013 KB

A moving block heuristic (MBH) is developed for earliness-tardiness scheduling problems, which are observed in just-in-time (JIT) production environments. The MBH is described for the single-machine environment under unrestrictive job due date conditions. The proposed MBH, which has polynomial compu

A production model with delivery time gu
โœ Wai Ki Ching ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 317 KB

We consider optimal (s, S) policies with delivery time guarantees for production planning in manufacturing systems with early set-up. The machine produces one type of product with delivery time guarantees on the products offered to the customers. The inter-arrival time of the demand and the processi