Production Scheduling Approaches for Operations Management

Scheduling is essentially the short-term execution plan of a production planning model. Production scheduling consists of the activities performed in a manufacturing company in order to manage and control the execution of a production process. A schedule is an assignment problem that describes into details (in terms of minutes or seconds) which activities must be performed and how the factory’s resources should be utilized to satisfy the plan. Detailed scheduling is essentially the problem of allocating machines to competing jobs over time, subject to the constraints. Each work center can process one job at a time and each machine can handle at most one task at a time. A scheduling problem, typically, assumes a fixed number of jobs and each job has its own parameters (i.e., tasks, the necessary sequential constraints, the time estimates for each operation and the required resources, no cancellations). All scheduling approaches require some estimate of how long it takes to perform the work. Scheduling affects, and is affected by, the shop floor organization. All scheduling changes can be projected over time enabling the identification and analysis of starting time, completion times, idle time of resources, lateness, etc....

[1]  Simon Haykin,et al.  Neural Networks: A Comprehensive Foundation , 1998 .

[2]  Colin R. Reeves,et al.  Heuristic Search Methods: A Review , 1996 .

[3]  Chandrasekharan Rajendran,et al.  A comparative study of dispatching rules in dynamic flowshops and jobshops , 1999, Eur. J. Oper. Res..

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Young Hoon Lee,et al.  A hybrid approach to sequencing jobs using heuristic rules and neural networks , 1995 .

[6]  R. Menzel,et al.  The flight paths of honeybees recruited by the waggle dance , 2005, Nature.

[7]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[8]  Robert H. Storer,et al.  Problem and Heuristic Space Search Strategies for Job Shop Scheduling , 1995, INFORMS J. Comput..

[9]  Wallace J. Hopp,et al.  Factory physics : foundations of manufacturing management , 1996 .

[10]  J. L. Gould,et al.  Honey bee recruitment: the dance-language controversy. , 1975, Science.

[11]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..

[12]  C. Reeves Modern heuristic techniques for combinatorial problems , 1993 .

[13]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[14]  N. Pierce Origin of Species , 1914, Nature.

[15]  Michael P. Wellman,et al.  Planning and Control , 1991 .

[16]  B. Roy,et al.  Les Problemes d'Ordonnancement , 1967 .

[17]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[18]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[19]  Michel Minoux,et al.  Graphes et algorithmes , 1995 .

[20]  S. Dreyfus,et al.  Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .

[21]  Walter Curtis Johnson,et al.  Introduction to modern electromagnetics , 1969 .

[22]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[23]  D. Pham,et al.  THE BEES ALGORITHM, A NOVEL TOOL FOR COMPLEX OPTIMISATION PROBLEMS , 2006 .

[24]  Yoshiyasu Takefuji,et al.  Stochastic neural networks for solving job-shop scheduling. I. Problem representation , 1988, IEEE 1988 International Conference on Neural Networks.

[25]  K. Frisch Bees: their vision, chemical senses, and language , 1950 .

[26]  Chin Soon Chong,et al.  Using A Bee Colony Algorithm For Neighborhood Search In Job Shop Scheduling Problems , 2007 .

[27]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[28]  J. Deneubourg,et al.  Self-organized shortcuts in the Argentine ant , 1989, Naturwissenschaften.

[29]  Fred W. Glover,et al.  Applying tabu search with influential diversification to multiprocessor scheduling , 1994, Comput. Oper. Res..

[30]  M. Rockstein Bees. Their Vision, Chemical Senses, and Language , 1952 .

[31]  Vladimir Cherkassky,et al.  A neural network approach to job-shop scheduling , 1991, IEEE Trans. Neural Networks.

[32]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[33]  V. Cerný Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[34]  Alain Hertz,et al.  Guidelines for the use of meta-heuristics in combinatorial optimization , 2003, Eur. J. Oper. Res..

[35]  T. Hill,et al.  Neural network models for forecast: a review , 1992, Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences.

[36]  Guy Theraulaz,et al.  Self-Organization in Biological Systems , 2001, Princeton studies in complexity.

[37]  D. Griffiths Introduction to Electrodynamics , 2017 .

[38]  Jwm Will Bertrand,et al.  The use of workload information to control job lateness in controlled and uncontrolled release production systems , 1983 .

[39]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[40]  Naim Dahnoun,et al.  Studies in Computational Intelligence , 2013 .

[41]  Shu-Cherng Fang,et al.  An Electromagnetism-like Mechanism for Global Optimization , 2003, J. Glob. Optim..

[42]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[43]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[44]  Lamberto Cesari,et al.  Optimization-Theory And Applications , 1983 .

[45]  J. Christopher Beck,et al.  Vehicle Routing and Job Shop Scheduling: What's the Difference? , 2003, ICAPS.

[46]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[47]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[48]  Grosan Crina,et al.  Stigmergic Optimization: Inspiration, Technologies and Perspectives , 2006 .

[49]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[50]  Christian Bierwirth,et al.  On Permutation Representations for Scheduling Problems , 1996, PPSN.

[51]  F. Fruggiero,et al.  From ants colony to artificial ants: a nature inspired algorithm to solve job scheduling problems , 2005 .

[52]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[53]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems: analysis, algorithms, and new applications , 1999 .

[54]  Marc M. Van Hulle A Goal Programming Network for Mixed Integer Linear Programming: a CaseStudy for the Job-Shop Scheduling Problem , 1991, Int. J. Neural Syst..

[55]  M. Tuba Artificial Bee Colony ( ABC ) Algorithm with Crossover and Mutation , 2012 .

[56]  Allan Pinkus,et al.  Multilayer Feedforward Networks with a Non-Polynomial Activation Function Can Approximate Any Function , 1991, Neural Networks.

[57]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[58]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[59]  Marc M. Van Hulle A goal programming network for linear programming , 2004, Biological Cybernetics.

[60]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[61]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[62]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[63]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[64]  George Winter Origin of the species. , 2005, Nursing standard (Royal College of Nursing (Great Britain) : 1987).

[65]  K. T. Yeo,et al.  An expert neural network system for dynamic job shop scheduling , 1994 .

[66]  James R. Evans,et al.  Heuristic methods and applications: A categorized survey , 1989 .

[67]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[68]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[69]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[70]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[71]  A. V. Olgac,et al.  Performance Analysis of Various Activation Functions in Generalized MLP Architectures of Neural Networks , 2011 .