Filters








124 Hits in 6.9 sec

A Stochastic Model for Prioritized Outpatient Scheduling in a Radiology Center

2020 International Journal of Engineering  
The objective is to minimize outpatients' total spent time in a radiology center. The problem is formulated as a flexible open shop scheduling problem and a stochastic programming model.  ...  This paper discussed the scheduling problem of outpatients in a radiology center with an emphasis on priority.  ...  SWSPTB MILP SWSPTB O F O F RD OF − = (23) Since the run time of the stochastic model is intensively enhanced for a moderate number of jobs (even in a problem with 2 stages), the objective function of the  ... 
doi:10.5829/ije.2020.33.04a.11 fatcat:5yvs6l6sprghddgd5st5lkdau4

An extensive and systematic literature review for hybrid flowshop scheduling problems

Murat Çolak, Gülşen Aydın Keskin
2022 International Journal of Industrial Engineering Computations  
In the HFSP, a series of jobs are processed respectively in a set of stages that at least one of these stages has more than one parallel machine (identical, uniform or unrelated).  ...  Hybrid flowshop scheduling problem (HFSP) is a mixture of two classical scheduling problems as parallel machine scheduling (PMS) and flowshop scheduling (FS).  ...  the proposed approach is superior than MILP model in terms of computational time.  ... 
doi:10.5267/j.ijiec.2021.12.001 fatcat:hfmfq3h73femphrdw4wgpedsfq

A Review of Prediction and Optimization for Sequence-Driven Scheduling in Job Shop Flexible Manufacturing Systems

Prita Meilanitasari, Seung-Jun Shin
2021 Processes  
This article reviews the state of the art of prediction and optimization for sequence-driven scheduling in job shop flexible manufacturing systems (JS-FMSs).  ...  reflect the dynamics and flexibility; production-level scheduling is restricted to increase responsiveness owing to product-level uncertainty; and optimization is more focused, while prediction is used  ...  Acknowledgments: We thank Heejin Seol for technical support via Smart Factory (Variant 4) analysis at the LINC+ Analytical Equipment Center at Hanyang University in Seoul.  ... 
doi:10.3390/pr9081391 fatcat:r3p5bzdlvnf2lnm6ymxq3vjcsm

Fast Scheduling of Robot Teams Performing Tasks With Temporospatial Constraints

Matthew C. Gombolay, Ronald J. Wilcox, Julie A. Shah
2018 IEEE Transactions on robotics  
We use this sequencer in conjunction with a MILP solver and empirically demonstrate the ability to generate near-optimal schedules for real-world problems an order of magnitude larger than those reported  ...  Our key innovation is a fast, satisficing multi-agent task sequencer inspired by real-time processor scheduling techniques and adapted to leverage hierarchical problem structure.  ...  The dispatchable form maintains flexibility to increase robustness to disturbances, and has been shown to decrease the amount of time spent re-computing solutions in response to disturbances for randomly  ... 
doi:10.1109/tro.2018.2795034 fatcat:xcpi4vrvxndw5fuycqpiby2pue

PRODUCTION ENGINEERING

2009 Journal of the American Society of Naval Engineers  
The processing time of a batch is the longest processing time among all the jobs in that batch. The problem under study is NP-hard for makespan objective.  ...  The processing times and the sizes of the jobs are known and non-identical. The machines can process a batch as long as its capacity is not exceeded.  ...  Total job completion time. 2. Avg job completion time. 3. Avg job waiting time. 4. Avg job lateness. 5. Avg number of jobs in the system. 6. Avg number of jobs waiting. 7. Set-up costs. 8.  ... 
doi:10.1111/j.1559-3584.1941.tb01541.x fatcat:hbqs6xeppbgtznarcju5vxjzei

Production Engineering [chapter]

2016 Standard Handbook of Petroleum and Natural Gas Engineering  
The processing time of a batch is the longest processing time among all the jobs in that batch. The problem under study is NP-hard for makespan objective.  ...  The processing times and the sizes of the jobs are known and non-identical. The machines can process a batch as long as its capacity is not exceeded.  ...  Total job completion time. 2. Avg job completion time. 3. Avg job waiting time. 4. Avg job lateness. 5. Avg number of jobs in the system. 6. Avg number of jobs waiting. 7. Set-up costs. 8.  ... 
doi:10.1016/b978-0-12-383846-9.00006-0 fatcat:jh7ozj633zdenegdiqnw6hsjne

Production Engineering

1979 Precision engineering  
The processing time of a batch is the longest processing time among all the jobs in that batch. The problem under study is NP-hard for makespan objective.  ...  The processing times and the sizes of the jobs are known and non-identical. The machines can process a batch as long as its capacity is not exceeded.  ...  Total job completion time. 2. Avg job completion time. 3. Avg job waiting time. 4. Avg job lateness. 5. Avg number of jobs in the system. 6. Avg number of jobs waiting. 7. Set-up costs. 8.  ... 
doi:10.1016/0141-6359(79)90121-1 fatcat:dmjjghi52ffujgxgax3knvsuqq

Production Engineering [chapter]

2004 Standard Handbook of Petroleum and Natural Gas Engineering  
The processing time of a batch is the longest processing time among all the jobs in that batch. The problem under study is NP-hard for makespan objective.  ...  The processing times and the sizes of the jobs are known and non-identical. The machines can process a batch as long as its capacity is not exceeded.  ...  Total job completion time. 2. Avg job completion time. 3. Avg job waiting time. 4. Avg job lateness. 5. Avg number of jobs in the system. 6. Avg number of jobs waiting. 7. Set-up costs. 8.  ... 
doi:10.1016/b978-075067785-1/50018-x fatcat:6fxx43ugundgpkbodpfhp3ell4

Distributional Reinforcement Learning for Scheduling of Chemical Production Processes [article]

Max Mowbray, Dongda Zhang, Ehecatl Antonio Del Rio Chanona
2022 arXiv   pre-print
The proposed strategy is investigated thoroughly in a parallel batch production environment, and benchmarked against mixed integer linear programming (MILP) strategies.  ...  In this work, we present a RL methodology tailored to efficiently address production scheduling problems in the presence of uncertainty.  ...  For a problem of this size, the RL approach is 500 times cheaper than the MILP.  ... 
arXiv:2203.00636v2 fatcat:abadwex26jdvlewukq4kwxcpiq

End-to-end latency and temporal consistency analysis in networked real-time systems

Michaël Lauer, Frédéric Boniol, Claire Pagetti, Jérôme Ermont
2014 International Journal of Critical Computer-Based Systems  
It is based on mixed integer linear programming (MILP) and is general in the sense that it can be applied to a variety of end-to-end properties.  ...  These approaches provide results only for local components behaviours. However, there is a growing need for having a global view of the system, in order to determine end-to-end properties.  ...  Also, the authors of Cucu-Grosjean and Buffet (2009) use a constraint satisfaction problem (CSP) to find a feasible real-time schedule of tasks in a multi-processor context.  ... 
doi:10.1504/ijccbs.2014.064667 fatcat:uddd2iyoqjemrino4mrsijccfy

A Deep Reinforcement Learning Approach for Chemical Production Scheduling

Christian D. Hubbs, Can Li, Nikolaos V. Sahinidis, Ignacio E. Grossmann, John M. Wassick
2020 Computers and Chemical Engineering  
mixed-integer linear programming (MILP) model that schedules each time interval on a receding horizon basis.  ...  Results show that the reinforcement learning method outperforms the naive MILP approaches and is competitive with a shrinking horizon MILP approach in terms of profitability, inventory levels, and customer  ...  The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.  ... 
doi:10.1016/j.compchemeng.2020.106982 fatcat:ikwie3vlznd7zpd2bl3j7slqle

Dynamic Fractional Resource Scheduling for cluster platforms

Mark Stillwell
2010 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)  
Explicit co-scheduling, or Gang scheduling, is a paradigm in which the entire parallel machine is multiplexed via distributed context switching so that processes within the same job are run within the  ...  Consequently, its stretch is no smaller than n because its processing time is λ 0 = 1. A possible schedule would have been to execute jobs in order of increasing processing time.  ... 
doi:10.1109/ipdpsw.2010.5470799 dblp:conf/ipps/Stillwell10 fatcat:kfyodiizkbafzbemmyyjnduwwe

Multiprocessor Real-Time Locking Protocols: A Systematic Review [article]

Björn B. Brandenburg
2019 arXiv   pre-print
A special focus is placed on the suspension-oblivious and suspension-aware analysis approaches for semaphore protocols, their respective notions of priority inversion, optimality criteria, lower bounds  ...  We systematically survey the literature on analytically sound multiprocessor real-time locking protocols from 1988 until 2018, covering the following topics: progress mechanisms that prevent the lock-holder  ...  jobs are scheduled in order of increasing lock-request times) [35] .  ... 
arXiv:1909.09600v1 fatcat:tmqcpiuxfbbd5jrcecgvoeanpm

A hybrid metaheuristic method to optimize the order of the sequences in continuous-casting

Achraf Touil, Abdelwahed Echchtabi, Adil Bellabdaoui, Abdelkabir Charkaoui
2016 International Journal of Industrial Engineering Computations  
In this paper, we propose a hybrid metaheuristic algorithm to maximize the production and to minimize the processing time in the steel-making and continuous casting (SCC) by optimizing the order of the  ...  sequences where a sequence is a group of jobs with the same chemical characteristics.  ...  Low (2005) proposed a heuristic based simulated annealing to deal with flexible flow shop scheduling problem with unrelated parallel machines where the objective was to minimize the total flow time.  ... 
doi:10.5267/j.ijiec.2016.2.001 fatcat:yxtwdyi7bvahlictj7jbjyf42e

A new heuristic and an exact approach for a production planning problem

Peter Auer, György Dósa, Tibor Dulai, Armin Fügenschuh, Peggy Näser, Ronald Ortner, Ágnes Werner-Stark
2020 Central European Journal of Operations Research  
size used in the exact approach.  ...  We deal with a very complex and hard scheduling problem.  ...  The problem we consider could be categorized as a Flexible Job Shop Problem (FJSP), however, it is not clearly defined what is the meaning of "flexible" as there are several different definitions.  ... 
doi:10.1007/s10100-020-00689-3 fatcat:aticuukjajcj5jkyg63qqtsx7a
« Previous Showing results 1 — 15 out of 124 results