The lazy cook problem, or scheduling two parallel machines to optimize vehicle utilization

International Journal of Flexible Manufacturing Systems

Volumn 15, Issue 4, 2003, Pages

  Arbib, Claudio ^a   Marinelli, Fabrizio ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Column generation; Non regular objective function; Parallel machine scheduling

Indexed keywords

ALGORITHMS; CUTTING; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; TRANSPORTATION;

COLUMN GENERATION; NON-REGULAR OBJECTIVE FUNCTIONS; PARALLEL MACHINE SCHEDULING;

MATERIALS HANDLING;

EID: 19644379593     PISSN: 09206299     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:FLEX.0000036059.45661.35     Document Type: Article

References (15)

1. Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., and Vance, P. H., "Branch-and-Price: Column Generation for Huge Integer Programs," Operations Research, Vol. 46, pp. 316-329 (1998).
2. Dror, M. and Stulman, A., "Optimal Robot's Service Movements: A One Dimensional Case," Computers in Industrial Engineering, Vol. 12, No. 1, pp. 39-46 (1987).
3. Dyckhoff, H., Scheithauer, G., and Terno, J., "Cutting and Packing," in Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffioli, and S. Martello (Eds.), Wiley, Chichester, pp. 393-412 (1997).
4. Garey, M. R. and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco, CA (1979).
5. Gilmore, P. C. and Gomory, R. E., "A Linear Programming Approach to the Cutting Stock Problem - Part I and II," Operations Research, Vol. 9, pp. 848-859 (1961).
6. Gilmore, P. C. and Gomory, R. E., "A Linear Programming Approach to the Cutting Stock Problem - Part II," Operations Research, Vol. 11, pp. 863-888 (1963).
7. Golumbic, M. C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, NY, pp. 204-205 (1980).
8. Graham, R. L., Lenstra, J. K., and Rinnooy Kan, A. H. G., "Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey," Annals of Discrete Mathematics, Vol. 5, pp. 287-326 (1979).
9. L'Ecuyer, P., Mayrand, M., and Dror, M., "Dynamic Scheduling of a Robot Serving Machines on a One-Dimensional Line," IIE Transactions, Vol. 23, No. 4, pp. 371-382 (1991).
10. Matsuo, H., Shang, J. S., and Sullivan, R. S., "A Crane Scheduling Prolem in a Computer-Integrated Manufacturing Environment," Management Science, Vol. 37, No. 5, pp. 587-605 (1991).
11. Rossi, F. and Smriglio, S., "A Branch-and-Cut Algorithm for the Maximum Cardinality Stable Set Problem," Operations Research Letters, Vol. 28, No. 2, pp. 63-74 (2001).
12. Sethi, S. P., Sidney, J. B., and Sriskandarajah, C., "Scheduling in Dual Gripper Robotic Cells for Productivity Gains," IEEE Transactions on Robotics and Automation, Vol. 17, No. 3, pp. 324-341 (2001).
13. Sethi, S. P., Sriskandarajah, C., Sorger, G., Blazewicz, J., and Kubiak, W., "Sequencing of Parts and Robot Moves in a Robotic Cell," International Journal of Flexible Manufacturing Systems, Vol. 4, pp. 331-358 (1992).
14. Su, Q. and Chen, F. F., "Optimal Sequencing of Double-Gripper Gantry Robot Moves in Tightly Coupled Serial Production Systems," IEEE Transactions on Robotics and Automation, Vol. 12, No. 1, pp. 22-30 (1996).
15. Woeginger, G. J. and Yu, Z., "On the Equal-Subset-Sum Problem, " Information Processing Letters, Vol. 42, pp. 299-302 (1992).