List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan

References

• Coffman , E. G. , Garey , M. R. and Johnson , D. S. 1978 . An application of bin-packing to multi-processor scheduling . SIAM Journal of Computing , 7 : 1 – 17 .
   Web of Science ®Google Scholar
• Dyckhoff , H. 1981 . A new linear programming approach to the cutting stock problem . Operations Research , 29 : 1092 – 1104 .
   Web of Science ®Google Scholar
• Dyckhoff , H. 1990 . A typology of cutting and packing problems . Euro J. of Operational Research , 44 : 145 – 159 .
   Web of Science ®Google Scholar
• Garey , M. R. and Johnson , J. S. 1979 . Computers and Intractability: a Guide to the Theory of NP-completeness , San Francisco , CA : Freeman .
   Google Scholar
• Gilmore , P. C. and Gomory , R. E. 1961 . A linear programming approach to the cutting stock problem . Operations Research , 9 : 849 – 859 .
   Web of Science ®Google Scholar
• Gilmore , P. C. and Gomory , R. E. 1963 . A linear programming approach to the cutting stock problem – Part II . Operations Research , 11 : 863 – 888 .
   Web of Science ®Google Scholar
• Golden , B. L. 1976 . Approaches to the cutting stock problem . AIIE Transactions , 8 : 265 – 274 .
   Google Scholar
• Graham , R. L. 1969 . Bounds on multiprocessor timing anomalies . SIAM J. of Applied Mathematics , 17 : 416 – 429 .
   Web of Science ®Google Scholar
• Gupta , J. N. D. and Ruiz-Torres , J. 2001 . A LISTFIT heuristic for minimizing makespan on identical parallel machines . Production Planning & Control , 12 : 28 – 36 .
   Web of Science ®Google Scholar
• Johnson , D. S. , Demers , A. , Ullman , J. D. , Gary , M. R. and Graham , R. L. 1974 . Worst-case performance bounds for simple one-dimensional packing algorithms . SIAM Journal of Computing , 3 ( 4 ) : 299 – 325 .
   Google Scholar
• Kantorovich , L. V. 1960 . Mathematical method of organizing and planning production . Management Science , 6 : 366 – 422 .
   Web of Science ®Google Scholar
• Parker , R. G. 1995 . Deterministic Scheduling Theory , London , UK : Chapman&Hall .
   Google Scholar
• Sukto , S. and Charnsethikul , P. A column generation approach for Scheduling of N job-groups through M parallel machines with minimum makespan . in Proceeding of Symposium in Production and Quality Engineering for Competitive Business Environment , June . pp. 131 – 145 . Bangkok , Thailand : Kasetsart University .
   Google Scholar