Filters








8,355 Hits in 6.3 sec

A fluid approach to large volume job shop scheduling

Yoni Nazarathy, Gideon Weiss
2010 Journal of Scheduling  
In large volume job shops it makes sense to solve a fluid problem and to schedule the jobs in such a way as to track the fluid solution.  ...  We consider large volume job shop scheduling problems, in which there is a fixed number of machines, a bounded number of activities per job, and a large number of jobs.  ...  Acknowledgement We are grateful to an anonymous referee for many helpful comments.  ... 
doi:10.1007/s10951-010-0174-0 fatcat:fzfjg4br4jg6deqs7jux3zavqa

Queueing-theoretic approaches for dynamic scheduling: A survey

Daria Terekhov, Douglas G. Down, J. Christopher Beck
2014 Surveys in Operations Research and Management Science  
This paper provides a context for investigating the integration of queueing theory and scheduling approaches with the goal of more effectively solving scheduling problems arising in dynamic environments  ...  In this paper, we provide an overview of queueingtheoretic models and methods that are relevant to scheduling in dynamic settings.  ...  Acknowledgements The authors would like to thank the reviewers for their comments, which helped improve the paper.  ... 
doi:10.1016/j.sorms.2014.09.001 fatcat:q3qodawkwnawneatlnzm4depcm

The Transfer of Japanese Manufacturing Management Approaches to U. S. Industry

Richard J. Schonberger
1982 Academy of Management Review  
Competitive Niche A company that produces in large volume may, it seems, decide on either the job-lot approach or the repetitive approach.  ...  Shop paper is reduced to a daily schedule by frame model.  ... 
doi:10.2307/257340 fatcat:csfsahlqybfu7cegwh2yoxyzve

The Transfer of Japanese Manufacturing Management Approaches to U.S. Industry

Richard J. Schonberger
1982 Academy of Management Review  
Competitive Niche A company that produces in large volume may, it seems, decide on either the job-lot approach or the repetitive approach.  ...  Shop paper is reduced to a daily schedule by frame model.  ... 
doi:10.5465/amr.1982.4285372 fatcat:66pdrldcqfbg3hawd4yurmusom

Achieving Cost Competitiveness with an Agent-Based Integrated Process Planning and Production Scheduling System [chapter]

Ming Lim, David Zhang
2012 Production Scheduling  
Xu et al. (2010) used a two-layer TS approach to schedule jobs with controllable processing times on a single machine in order to meet costumer due dates.  ...  Assume that machine agents representing the machines on the production shop floor and a job agent representing a job (e.g. to produce a component) to be performed which can be broken down into a number  ... 
doi:10.5772/25887 fatcat:vleeedjaxzfeboeejn43fg5wkm

Out-of-Core and Dynamic Programming for Data Distribution on a Volume Visualization Cluster

S. Frank, A. Kaufman
2009 Computer graphics forum (Print)  
In this paper, we define the load balanced network distribution (LBND) problem and map it to the NP-complete precedence constrained job-shop scheduling problem.  ...  We introduce a kd-tree solution and a dynamic programming solution. To process a massive data set, either a parallel or an out-of-core approach is required.  ...  The input to the job shop scheduling problem is a list of jobs, with associated resource requirements, and a DAG of job dependences.  ... 
doi:10.1111/j.1467-8659.2008.01307.x fatcat:zvyq4mnm5nghlfr46clspf2f2q

Makespan estimation in batch process industries: A comparison between regression analysis and neural networks

W.H.M Raaymakers, A.J.M.M Weijters
2003 European Journal of Operational Research  
In batch process industries it is difficult to estimate the completion time, or makespan, of a set of jobs, because jobs interact at the shop floor.  ...  We assume a situation with hierarchical production control consisting of a planning level and a scheduling level. In this paper we focus on the planning level.  ...  Sabuncuoglu and Gurgun (1996) combine algorithmic and neural net approaches to solve the single machine mean tardiness scheduling problem and the minimum makespan job-shop scheduling problem.  ... 
doi:10.1016/s0377-2217(02)00173-x fatcat:d2yw7hwlerdbjjy23ia43g3nay

A New Approach Generating Robust and Stable Schedules in m-Machine Flow Shop Scheduling Problems: A Case Study

2020 International Journal of Engineering  
Moreover, a tri-component measure based on efficiency, robustness, and stability is proposed which aims to create a realistic schedule to satisfy the customers, manufacturers, and the staff.  ...  To meet the customer's requirements, the robustness measure is defined based on the tardiness and the delivery dates of jobs.  ...  INTRODUCTION 1 The shop scheduling literature includes a large number of papers dealing with the classical permutation flowshop scheduling (FSS) problem, in which a set of jobs must be processed on the  ... 
doi:10.5829/ije.2020.33.02b.14 fatcat:ngxfjvqsajbwjhmcmy4xkx4p2a

Flexible Manufacturing Systems: background examples and models [chapter]

W. H. M. Zijm
1988 Operations Research Proceedings  
We show how the concept of a Flexible Manufacturing System (FMS) naturally arises as an attempt to combine the advantages of tradi tional Job Shops and dedicated production lines.  ...  The main body of the paper is devoted to a classification of FMS problem areas and a review of models developed to understand and solve these problems.  ...  However, recent results in job shop scheduling theory justify the exploi tation of more advanced algori thms in our FMS scheduling problem.  ... 
doi:10.1007/978-3-642-73778-7_22 fatcat:6u7ij22pyjdwtasn55p46atzti

Production Planning and Scheduling: Interaction and Coordination [chapter]

Yiwei Cai, Erhan Kutanoglu, John Hasenbein
2011 International Series in Operations Research and Management Science  
the jobs.  ...  This is usually achieved by creating specific work orders or jobs of different product types that collectively resemble the output required by the production plan and generating a release schedule for  ...  Dai and Weiss (2002) develop a fluid-relaxation-based heuristic to minimize makespan in job shops.  ... 
doi:10.1007/978-1-4419-8191-2_2 fatcat:skvu55lgj5civep3uwjzl2smqq

Robust dynamic schedule coordination control in the supply chain

Dmitry Ivanov, Alexandre Dolgui, Boris Sokolov
2016 Computers & industrial engineering  
A hybrid discrete/continuous flow shop supply chain with job shop processes at each supplier stage is studied with dynamic optimal control models.  ...  The application of attainable sets opens a possibility to analyse feasible schedule executions under disruptions.  ...  Artigues et al. (2005) propose to generate a family of schedules instead of a unique one to maintain schedule robustness in a job shop environment.  ... 
doi:10.1016/j.cie.2016.01.009 fatcat:d2xwdo2bjbh5hehi6uzhcco7pe

Page 24 of Technical Book Review Index Vol. 27, Issue 2 [page]

1961 Technical Book Review Index  
“Written to fulfil a need for a textbook in the field of heat transfer which presents a fundamental approach in a _ suitably rigorous manner.  ...  highlights such factors as work-flow schedules, mill orders, warehouse orders and shop organization.”  ... 

Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons

C. Dimopoulos, A.M.S. Zalzala
2000 IEEE Transactions on Evolutionary Computation  
A wide range of problems is covered, from job shop and flow shop scheduling, to process planning and assembly line balancing.  ...  The use of intelligent techniques in the manufacturing field has been growing the last decades due to the fact that most manufacturing optimization problems are combinatorial and NP hard.  ...  ACKNOWLEDGMENT The authors would like to thank the reviewers for their helpful comments.  ... 
doi:10.1109/4235.850651 fatcat:akevaqtprzab5cgs3y3y534aju

An iterative agent bidding mechanism for responsive manufacturing

M.K. Lim, Z. Zhang, W.T. Goh
2009 Engineering applications of artificial intelligence  
A simulated annealing optimisation technique is employed to optimise the currency values iteratively.  ...  This paper presents an iterative agent bidding mechanism, which performs dynamic integration of process planning and production scheduling to generate optimised process plans and schedules in response  ...  However, the above reviewed works are designed to address the process planning and scheduling without taking into consideration shop floor disturbances such as machine breakdown, change of production volume  ... 
doi:10.1016/j.engappai.2008.12.003 fatcat:dugsihbwmfazjduy3kucdjq7ym

Mathematical Modeling and a Hybrid NSGA-II Algorithm for Process Planning Problem Considering Machining Cost and Carbon Emission

Jin Huang, Liangliang Jin, Chaoyong Zhang
2017 Sustainability  
Process planning is an important function in a manufacturing system; it specifies the manufacturing requirements and details for the shop floor to convert a part from raw material to the finished form.  ...  Meanwhile, according to the computational results of Kim's benchmark, we find that both of the total machining cost and carbon emission are roughly proportional to the number of operations, and a process  ...  Different from our previous study, however, process planning does not cling to the job shop scheduling any more in this case; a position based modeling strategy is thus adopted in the proposed model.  ... 
doi:10.3390/su9101769 fatcat:ozf52jvpkncxhh45baogrga52i
« Previous Showing results 1 — 15 out of 8,355 results