Maximization of Production Capacity for a Bake Plant's Processing Line with Due Date Constraint Between Each Process

This paper examines a scheduling problem with perishable items in a food processing plant. The food processing industry presents unique technical challenges to automation. Products (grocery items) and raw materials of food processing plant drastically drop their quality in proportion to the passage of time. Items with this characteristic are defined as “Perishable items”. About these items, time factor is extremely important. In general, the production scale of food processing industry is small compared with any other industry such as the automotive industry, the consumer electronics industry, and mining and manufacturing industry. Recently, community structure has brought about a drastic change. In spite of such environment, the food processing industry has to carry out the high-mix low-volume production to meet the customer's demand, the global competition, and the variation in popular taste. Food processing industry traditionally has been less automated than other sectors. However scheduling as science-based approach in food processing industry is complex and difficult, it is worth introducing an effective scheduling system and a research on effective operation. In this paper, we concentrate a bake plant to examine the food’s particular characteristic in food processing line. And more, in order to operate a more efficient production scheduling for bread processing line in a bake plant, we consider a scheduling problem with perishable items for a bake plant, it is as a typical example of food processing industry. By removing the opportunity loss and the useless factors at the production process thoroughly, the production method is described.

[1]  Serpil Sayin,et al.  A bicriteria approach to the two-machine flow shop scheduling problem , 1999, Eur. J. Oper. Res..

[2]  G.D.H. Claassen,et al.  Planning and scheduling packaging lines in food industry , 1993 .

[3]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[4]  C. M. Jakeman Scheduling needs of the food processing industry , 1994 .

[5]  Naoya Honda Backtrack Beam Search for Multiobjective Scheduling Problem , 2003 .

[6]  D. P. Donk,et al.  Combined make-to-order and make-to-stock in a food production system , 2004 .

[7]  Kunihiko Hiraishi,et al.  Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs , 2000, Comput. Oper. Res..

[8]  Pierre Borne,et al.  A study of scheduling problem in agro-food manufacturing systems , 2002, Math. Comput. Simul..

[9]  Hong Zhang,et al.  Simulation-based optimization for dynamic resource allocation , 2004 .

[10]  Hiroaki Ishii,et al.  Approximation algorithms for scheduling problems , 2000 .

[11]  Gur Mosheiov,et al.  A note on the maximum number of on-time jobs on parallel identical machines , 2003, Comput. Oper. Res..

[12]  V. Donk Make to stock or make to order: the decoupling point in the food processing industries , 2001 .

[13]  Michel Nakhla Production control in the food processing industry: The need for flexibility in operations scheduling , 1995 .

[14]  Kap Hwan Kim,et al.  A crane scheduling method for port container terminals , 2004, Eur. J. Oper. Res..

[15]  Chung-Lun Li,et al.  Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs , 1995, Comput. Oper. Res..