Filters








1,695 Hits in 10.9 sec

Page 942 of The Journal of the Operational Research Society Vol. 45, Issue 8 [page]

1994 The Journal of the Operational Research Society  
, Turkey In this paper we consider the job shop scheduling problem under a discrete non-renewable resource constraint.  ...  We first describe the approximation algorithm developed and then introduce two lower bounds for the n-job, m-machine resource-constrained job shop scheduling problem.  ... 

Job Shop Scheduling under a Non-Renewable Resource Constraint

Aysegul Toker, Suna Kondakci, Nesim Erkip
1994 Journal of the Operational Research Society  
, Turkey In this paper we consider the job shop scheduling problem under a discrete non-renewable resource constraint.  ...  We first describe the approximation algorithm developed and then introduce two lower bounds for the n-job, m-machine resource-constrained job shop scheduling problem.  ... 
doi:10.2307/2584018 fatcat:vtqzmm5nnzchzoc2obisxsjyji

An effective heuristic for flexible job-shop scheduling problem with maintenance activities

Shijin Wang, Jianbo Yu
2010 Computers & industrial engineering  
In this paper, a flexible job-shop scheduling problem with machine availability constraints is considered.  ...  Most production scheduling problems, including the standard flexible job-shop scheduling problem (FJSP), assume that machines are continuously available.  ...  Breit (2006) investigated a problem of scheduling n preemptive jobs in a two-machine flow shop where the first machine is not available for processing during a given time interval, with the minimization  ... 
doi:10.1016/j.cie.2010.05.016 fatcat:2bfx2nc43rawfplfiqbezr5nei

Timetabling of sorting slots in a logistic warehouse

Antoine Jouglet, Dritan Nace, Christophe Outteryck
2013 Annals of Operations Research  
can be processed over the considered time horizon without violating the resource constraint on sorting slots.  ...  We consider a set of orders to be prepared on some preparation shops over a given time horizon. Each order is associated with the truck handling its transportation to its customer.  ...  Note that the period on which the resource constraint applies depends only on the start-time of the job, contrary to classical scheduling problems in which it depends on periods on which the job is really  ... 
doi:10.1007/s10479-013-1499-9 fatcat:mat3v5dbqbajzakxeir3jhnytq

Page 7472 of Mathematical Reviews Vol. , Issue 2004i [page]

2004 Mathematical Reviews  
Summary: “In this note, we investigate the time complexity of non-preemptive shop scheduling problems with two jobs.  ...  shop scheduling with two jobs.  ... 

Page 3686 of Mathematical Reviews Vol. , Issue 2002E [page]

2002 Mathematical Reviews  
Summary: “This paper describes an efficient exact algorithm for project scheduling with resource constraints.  ...  Necessary and sufficient conditions for the existence of a single machine preemptive schedule in which all jobs are completed in time are given.  ... 

Job-shop Scheduling Over a Heterogeneous Platform

Hector Benitez-Perez, Jose A. Hermosillo-Gomez
2021 International Journal of Computers Communications & Control  
Besides job-shop scheduling has direct impacts on the production efficiency and costs of manufacturing systems. So that the development of analysis for tasks with these characteristics is necessary.  ...  An extension of the schedulability test proposed by Baruah in 2006 for non-preemptive periodic tasks over an identical platform is presented in this paper.  ...  Non-preemptive scheduling is widely used in industry, and it may be preferable to preemptive scheduling for certain reasons [8] : non-preemptive scheduling algorithms are easier to implement and have  ... 
doi:10.15837/ijccc.2021.3.4221 fatcat:qoigywssg5aknjtjuaaymyd4ni

Page 7219 of Mathematical Reviews Vol. , Issue 99j [page]

1999 Mathematical Reviews  
Anderson (5S-NSWMG; Sydney) 99j:90039 90B35 Le Pape, Claude; Baptiste, Philippe (F-COMP-HU; Compiégne) Resource constraints for preemptive job-shop scheduling.  ...  After a theoretical comparison of these approaches, they are experimen- tally compared based on a branch and bound algorithm for the preemptive job shop scheduling problems.  ... 

Preemptive Job-Shop Scheduling Using Stopwatch Automata [chapter]

Yasmina Abdeddaïm, Oded Maler
2002 Lecture Notes in Computer Science  
In this paper we show how the problem of job-shop scheduling where the jobs are preemptible can b emodeled naturally as a shortest path problem de ned on an extension of timed automata, namely stopwatch  ...  We present several algorithms and heuristics for nding the shortest paths in such automata and test their implementation on numerous b e n c hmark examples.  ...  Preemptive Job-Shop Scheduling The Job-shop scheduling problem is a generic resource allocation problem in which common resources (\machines") are required at various time points (and for given durations  ... 
doi:10.1007/3-540-46002-0_9 fatcat:fxz3gyyzo5bwpd4ijddz2hvxai

Scheduling of Real-Time Tasks with Multiple Critical Sections in Multiprocessor Systems

Jian-Jia Chen, Junjie Shi, Georg Von der Bruggen, Niklas Ueter
2020 IEEE transactions on computers  
In this paper, we remove this restriction and demonstrate how to utilize algorithms for the classical job shop scheduling problem to construct a dependency graph for tasks with multiple critical sections  ...  The performance of multiprocessor synchronization and locking protocols is a key factor to utilize the computation power of multiprocessor systems under real-time constraints.  ...  The authors thank Zewei Chen and Maolin Yang for their tool SET-MRTS [12] (Schedulability Experimental Tools for Multiprocessors Real Time Systems) to evaluate the GS-MSRP, LP-GFP-FMLP, and ROP-PCP in  ... 
doi:10.1109/tc.2020.3043742 fatcat:5i6bsm3csbh4ze5amy5neq5ch4

Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria [chapter]

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2005 Lecture Notes in Computer Science  
We also improve the results of Kim (SODA 2003, 97-98 ) for npSMC of line graphs and for resource-constrained scheduling.  ...  We consider a general class of scheduling problems where a set of dependent jobs needs to be scheduled (preemptively or non-preemptively) on a set of machines so as to minimize the weighted sum of completion  ...  We thank Moses Charikar and Chandra Chekuri for helpful comments and suggestions.  ... 
doi:10.1007/978-3-540-31833-0_8 fatcat:w4rvcm4nprcjhnthpcnppi3jxq

Job Shop Scheduling under a Non-Renewable Resource Constraint

Aysegül Toker, Suna Kondakci, Nesim Erkip
1994 Journal of the Operational Research Society  
Job Shop Scheduling Under a Non-renewable Resource Constraint bottleneck procedure.  ...  , Turkey In this paper we consider the job shop scheduling problem under a discrete non-renewable resource constraint.  ... 
doi:10.1057/jors.1994.146 fatcat:6ryte6aknzch3dvqymqe6xbqk4

Improved bounds for scheduling conflicting jobs with minsum criteria

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2008 ACM Transactions on Algorithms  
We also improve the results of Kim (SODA 2003, 97-98 ) for scheduling jobs on line graphs and for resource-constrained scheduling.  ...  We consider a general class of scheduling problems where a set of conflicting jobs needs to be scheduled (preemptively or non-preemptively) on a set of machines so as to minimize the weighted sum of completion  ...  We thank Moses Charikar and Chandra Chekuri for helpful comments and suggestions. We also thank an anonymous referee for many insightful comments on the paper.  ... 
doi:10.1145/1328911.1328922 fatcat:w2xdn36v6jax5fuywex6ozwlda

Page 814 of The Journal of the Operational Research Society Vol. 42, Issue 9 [page]

1991 The Journal of the Operational Research Society  
RINNOOyY KAN (1982) Scheduling subject to nonrenewable resource constraints. Op/ Res. Lett. 1, 52-55. . J. GRABOwsKI and A. JANIAK (1987) Job-shop scheduling with resource-time models of operations.  ...  SLOwINsKI (1984) Preemptive scheduling of independent jobs on parallel machines subject to financial constraints. Eur. J. Opl Res. 15, 366-373. . J. CARLIER and A. H. G.  ... 

Literature Review of Open Shop Scheduling Problems

Ellur Anand, Ramasamy Panneerselvam
2015 Intelligent Information Management  
sum of weighted tardiness of all jobs, minimization of weighted sum of tardy jobs, and miscellaneous measures of the open shop scheduling problem.  ...  This paper discusses review of literature of open shop scheduling problems.  ...  Acknowledgements The authors thank the anonymous referees for their constructive suggestions, which have improved the paper. References  ... 
doi:10.4236/iim.2015.71004 fatcat:shukynonjrfaleqiousjru3ari
« Previous Showing results 1 — 15 out of 1,695 results