Filters








1,311 Hits in 3.7 sec

Scheduling strategies for the bicriteria optimization of the robustness and makespan

Louis-Claude Canon, Emmanuel Jeannot
2008 Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)  
In this paper we study the problem of scheduling a stochastic task graph with the objective of minimizing the makespan and maximizing the robustness.  ...  We compare these different strategies experimentally and show that we are able to find different approximations of the Pareto front of this bicriteria problem.  ...  The problem of defining what robustness is has been studied in the literature. There exists several metrics for describing the robustness of the schedule with regards to the makespan.  ... 
doi:10.1109/ipdps.2008.4536366 dblp:conf/ipps/CanonJ08 fatcat:yfgyc2fnmbbchfobcl522yr3oe

Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments

Louis-Claude Canon, Emmanuel Jeannot
2010 IEEE Transactions on Parallel and Distributed Systems  
We compare these different approaches experimentally and show that we are able to find different approximations of the Pareto front for this bicriteria problem.  ...  Additionally, we proposed different strategies for minimizing the makespan while maximizing the robustness: from an evolutionary metaheuristic (best solutions but longer computation time) to more simple  ...  They propose two new robustness metrics for the scheduling problem.  ... 
doi:10.1109/tpds.2009.84 fatcat:gbqx33ope5hz7bom5lsplxw7da

Energy efficiency, robustness, and makespan optimality in job-shop scheduling problems

Miguel A. Salido, Joan Escamilla, Federico Barber, Adriana Giret, Dunbing Tang, Min Dai
2015 Artificial intelligence for engineering design, analysis and manufacturing  
However, most of them do not take into account energy consumption and robustness. We focus our attention in a job-shop scheduling problem where machines can work at different speeds.  ...  It can be observed that there exists a clear relationship between robustness and energy efficiency and a clear trade-off between robustness/energy efficiency and makespan.  ...  Figure 3 : 3 Approximate Pareto Front for the bicriteria Energy Consumption-Robustness. Figure 4 : 4 Approximate Pareto Front for the bicriteria Makespan-Robustness.  ... 
doi:10.1017/s0890060415000335 fatcat:f254mm3l4rb6pcwnifn3dcboom

A Robust Expected Makespan for Permutation Flow Shop Scheduling Depending on Machine Failure Rate

Ghazwan Alsoufi, Manal Abdulkareem Zeidan, Lamyaa Jasim Mohammed, Abdellah Salhi
2021 International journal of mathematical, engineering and management sciences  
For solving this problem with consideration to minimizing the expected makespan and maximizing the robustness simultaneously, the well-known (NEH) heuristic is implemented to schedule a set of jobs.  ...  The environment of Flow Shop Scheduling Problems (FSSPs) to minimize the makespan of n jobs that have to be performed on m machines is considered.  ...  Acknowledgments All authors are very grateful to the University of Mosul-Iraq/College of Computer Sciences and Mathematics and the University of Essex-UK for their support to finish this paper.  ... 
doi:10.33889/ijmems.2021.6.5.081 fatcat:ffpfjjo77vaz7jsdifohtgf3oe

A neutrosophic number based memetic algorithm for the integrated process planning and scheduling problem with uncertain processing times

Liangliang Jin, Chaoyong Zhang, Xiaoyu Wen, George Gershom Christopher
2020 IEEE Access  
This research presents a novel perspective or methodology to seek more robust solutions for the uncertain IPPS problem.  ...  Lots of novel meta-heuristics have been applied to the integrated process planning and scheduling (IPPS) problem for an efficient utilization of manufacturing resources; nevertheless, the tricky part in  ...  This research tries to develop an effective optimization approach to capture more promising and robust scheduling schemes for the IPPS instances.  ... 
doi:10.1109/access.2020.2996496 fatcat:jbom24op4jcxlgynbdvpchtsaa

The triangle scheduling problem

Christoph Dürr, Zdeněk Hanzálek, Christian Konrad, Yasmina Seddik, René Sitters, Óscar C. Vásquez, Gerhard Woeginger
2017 Journal of Scheduling  
We also show that the problem is unary NP-hard for instances with binary tree ratio B Christoph Dürr strictly larger than 2 and provide a quasi-polynomial time approximation scheme.  ...  This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels.  ...  We show that the problem is strongly NP-hard, which implies that TS does not admit a fully polynomial time approximation scheme (FPTAS), unless P = N P.  ... 
doi:10.1007/s10951-017-0533-1 fatcat:ctxgpsryjvcmpfnc466yifr77m

The triangle scheduling problem [article]

Christoph Dürr, Zdeněk Hanzálek, Christian Konrad, Yasmina Seddik, René Sitters, Óscar C. Vásquez, Gerhard Woeginger
2016 arXiv   pre-print
We also show that the problem is unary NP-hard for instances with binary tree ratio strictly larger than 2, and provide a quasi polynomial time approximation scheme (QPTAS).  ...  This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels.  ...  We show that the problem is strongly NP-hard, which implies that TS does not admit a fully polynomial time approximation scheme (FPTAS), unless P = N P .  ... 
arXiv:1602.04365v3 fatcat:s32xqblwuzabhowcbv53be3rsm

Robustness and stability measures for scheduling: single-machine environment

Selcuk Goren, Ihsan Sabuncuoglu
2008 IIE Transactions  
This paper addresses the issue of finding robust and stable schedules with respect to random disruptions. Specifically, two surrogate measures for robustness and stability are developed.  ...  The results indicate that one of the proposed surrogate measures performs better than existing methods for the total tardiness and total flowtime criteria in a periodic scheduling environment.  ...  Note that the average slack method for robustness was originally developed for the job shop scheduling problem with a makespan criterion.  ... 
doi:10.1080/07408170701283198 fatcat:gwecwfyljrbirj4rghwha6c4hi

Online Scheduling with Bounded Migration [chapter]

Peter Sanders, Naveen Sivadasan, Martin Skutella
2004 Lecture Notes in Computer Science  
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan.  ...  We also present a linear time 'online approximation scheme', that is, a family of online algorithms with competitive ratio 1 + and constant migration factor β( ), for any fixed > 0.  ...  We would also like to thank Gerhard Woeginger for interesting discussions and helpful comments on the topic of this paper.  ... 
doi:10.1007/978-3-540-27836-8_92 fatcat:llzrystvnzc4ln6plpttf66etq

Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research

I. Sabuncuoglu, S. Goren
2009 International journal of computer integrated manufacturing (Print)  
Proactive scheduling is then focused on and several robustness and stability measures are presented.  ...  Previous research on scheduling robustness and stability is also reviewed and further research directions are suggested.  ...  The 25 robustness measure for a given schedule is represented as a convex combination of expected makespan of the realized schedule and expected deviation from the original deterministic makespan (a convex  ... 
doi:10.1080/09511920802209033 fatcat:zb4xsuzlx5fdpomkuxwpkn5cw4

Approximate and robust bounded job start scheduling for Royal Mail delivery offices

Dimitrios Letsios, Jeremy T. Bradley, Suraj G, Ruth Misener, Natasha Page
2021 Journal of Scheduling  
Given a collection of schedules of makespan $$\le D$$ ≤ D , this approach allows distinguishing which are the more robust.  ...  AbstractMotivated by mail delivery scheduling problems arising in Royal Mail, we study a generalization of the fundamental makespan scheduling $$P||C_{\max }$$ P | | C max problem which we call the bounded  ...  Further, P||C max admits a polynomialtime approximation scheme (PTAS).  ... 
doi:10.1007/s10951-021-00678-7 fatcat:4cmlpggotjddfgd3sbu6hsdtr4

Online Scheduling with Bounded Migration

Peter Sanders, Naveen Sivadasan, Martin Skutella
2009 Mathematics of Operations Research  
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan.  ...  We also present a linear time 'online approximation scheme', that is, a family of online algorithms with competitive ratio 1 + and constant migration factor β( ), for any fixed > 0.  ...  We would also like to thank Gerhard Woeginger for interesting discussions and helpful comments on the topic of this paper.  ... 
doi:10.1287/moor.1090.0381 fatcat:4rdzvj2jjnht3foeesyuxz2s2m

Novel slack-based robust scheduling rule for a semiconductor manufacturing system with uncertain processing time

Juan LIU, Fei QIAO, Yumin MA, Weichang KONG
2018 Frontiers of Engineering Management  
To improve the robustness of the scheduling scheme, we propose a novel slack-based robust scheduling rule (SR) based on the analysis of robustness measurement for SMS with uncertain processing time.  ...  The NP-hard scheduling problems of semiconductor manufacturing systems (SMSs) are further complicated by stochastic uncertainties.  ...  Therefore, for the same scheduling problem, slack time can be applied to the qualitative analysis on the robustness of different scheduling schemes.  ... 
doi:10.15302/j-fem-2018045 fatcat:xujfadorivfzfewga33ziu5w7y

A Proactive Robust Scheduling Method for Aircraft Carrier Flight Deck Operations with Stochastic Durations

Xichao Su, Wei Han, Yu Wu, Yong Zhang, Jie Liu
2018 Complexity  
Then, in terms of proactive planning, both serial and parallel schedule generation schemes for baseline schedule and robust personnel allocation scheme and equipment allocation adjustment scheme for resource  ...  On this basis, a mathematical model of the robust scheduling problem for flight deck operation (RSPFDO) is established, and the goal is to maximize the probability of completing within the limitative makespan  ...  Then, a robust personnel allocation scheme and a robust equipment allocation adjustment scheme for a fixed baseline schedule are designed.  ... 
doi:10.1155/2018/6932985 fatcat:xnycdaujr5espo2jrnt7unvcjy

Approximate and Robust Bounded Job Start Scheduling for Royal Mail Delivery Offices [article]

Dimitrios Letsios, Jeremy T. Bradley, Suraj G, Ruth Misener, Natasha Page
2021 arXiv   pre-print
Motivated by mail delivery scheduling problems arising in Royal Mail, we study a generalization of the fundamental makespan scheduling P||Cmax problem which we call the bounded job start scheduling problem  ...  Given a collection of schedules of makespan <= D, this approach allows distinguishing which are the more robust.  ...  Further, P ||C max admits a polynomial-time approximation scheme (PTAS).  ... 
arXiv:1912.06862v2 fatcat:vva45przdrdhlggq4ogt6lck4a
« Previous Showing results 1 — 15 out of 1,311 results