Location of Repository

Report on "Scheduling in a factory"

By J. Orestes Cerdeira, T. Charters, M. Cruz, P. Freitas and P.B. Vasconcelos

Abstract

In order to carry out their orders of shoe soles, this company has a number of tasks T_1, ..., T_n of different lengths to be assigned to groups of machines.\ud Each group is operated by one worker (two in one case), and an operation cycle corresponds to injection, cooling, and removal of the sole. The time taken at each step varies from one order to another, and when starting a new task a machine needs to be tuned, which takes some extra time. Machines are working in parallel. At the moment the assignment is carried out empirically, and the problem proposed is to optimize the procedure

Topics: Retail
Year: 2008
OAI identifier: oai:generic.eprints.org:213/core70

Suggested articles

Preview

Citations

  1. (1997). Laarhoven, “Simulated annealing”, in Local Search in Combinatorial Optimization
  2. (1987). Simulated Annealing: Theory and Applications, doi
  3. (1973). Layland,Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment, doi
  4. (1988). Integer and combinatorial optimization, doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.