Abstract
Scheduling n jobs in an m machine flowshop is considered in order to minimize the sum of job completion times. Heuristic procedures for solving such problems are developed and the solutions are compared against optimal solutions for smaller size problems. For larger problems, solutions obtained by different heuristics are compared against each other. All of the solutions are obtained using an IBM Personal computer. Also addressed are the scheduling problems when jobs arrive at different times assumed to be deterministic.RésuméOn étudie l'ordonnancement de n tǎches dans un atelier comportant m machines, dans le but de minimiser le temps total de production. Des méthodes heuristiques sont proposées. Lorsque les problèmes sont de petite taille, les solutions heuristiques sont comparées aux solutions optimales; lorsqu'ils sont de plus grande taille, elles sont comparées les unes aux autres. Dans tous les cas, on utilise un ordinateur personnel de marque IBM. On étudie également les problèmes d'ordonnancement lorsque les intervalles qui séparent les arrivées des tǎches sont de caractère déterministe.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Canadian Journal of Administrative Sciences / Revue Canadienne des Sciences de l'Administration
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
