920 Hits in 9.8 sec

Page 2006 of The Journal of the Operational Research Society Vol. 60, Issue Supplement 1 [page]

2009 The Journal of the Operational Research Society  
A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness. Ann Disc Math 1: 331-342. Lawler EL (1978).  ...  An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Disc Appl Math 5: 99-109. Held M and Karp RM (1971).  ... 

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Panneerselvam Senthilkumar, Sockalingam Narayanan
2010 Intelligent Information Management  
The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds.  ...  This paper presents a survey of single machine scheduling problem with uniform parallel machines.  ...  Toung, Soukhal and Jean-Charless Billaut [46] have developed algorithm for uniform parallel machines scheduling problem with a common due date to mini-mize total weighted tardiness.  ... 
doi:10.4236/iim.2010.28056 fatcat:cugkndehgrgedbxdjuga7mz7e4

Scheduling with Time-Dependent Processing Times

Yunqiang Yin, T. C. E. Cheng, Chin-Chia Wu
2014 Mathematical Problems in Engineering  
Wan reviews the problem of scheduling deteriorating jobs on a single machine to minimize the makespan and provides a new fully polynomial-time approximation scheme for the problem.  ...  Steiner consider single-machine scheduling with learning/deterioration effects, time-dependent processing times, and due date assignment to minimize the weighted number of tardy jobs.  ...  Wan reviews the problem of scheduling deteriorating jobs on a single machine to minimize the makespan and provides a new fully polynomial-time approximation scheme for the problem.  ... 
doi:10.1155/2014/201421 fatcat:dwsr4o2cvbafhmvn6jkhy3xgzm

Page 2232 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
Summary: “We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date.  ...  The common due date is assumed to be so ample that all jobs can be completed by the due date.  ... 

Page 3443 of Mathematical Reviews Vol. , Issue 93f [page]

1993 Mathematical Reviews  
-GAIT-I) Scheduling jobs with stochastic processing times and due dates to minimize total tardiness.  ...  Summary: “We study the optimality of expected earliest due date sequencing of n jobs on M parallel identical machines to minimize the total tardiness.  ... 

A Comparative Analysis of Job Scheduling for Optimum Performance of Parallel Machines by Considering the Energy Consumption

Maurizio Faccio, Mojtaba Nedaei, Francesco Pilati
2018 European Journal of Engineering Research and Science  
In this study, a comparative analysis of scheduling of machines and jobs was conducted by proposing a method, which aims to optimize the performance of the job-shop environment.  ...  Then, subject to the defined technical constraints of the system, a comparative analysis on the basis of eight scheduling methods was conducted to assess the performance indicators of the job-shop system  ...  The priority order is performed from smaller to larger values. 3) The earliest due date (EDD) The EDD method is a common dispatching scheduling method, which relies on the scheduling of the due dates  ... 
doi:10.24018/ejers.2018.3.9.841 fatcat:rifh7bfk4vhprgukcje44pkz3q

A multi objective volleyball premier league algorithm for green scheduling identical parallel machines with splitting jobs

Khodakaram Salimifard, Jingpeng Li, Davood Mohammadi, Reza Moghdani
2020 Applied intelligence (Boston)  
This paper proposes a mathematical model for scheduling parallel machines with splitting jobs and resource constraints.  ...  AbstractParallel machine scheduling is one of the most common studied problems in recent years, however, this classic optimization problem has to achieve two conflicting objectives, i.e. minimizing the  ...  Conclusions This research focused on the parallel machine scheduling with splitting jobs on a set of identical machines minimizing wastes and total tardiness.  ... 
doi:10.1007/s10489-020-02027-1 fatcat:5ptss32qkbetzich5j6cw7gu4m

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

2004 Mathematical Reviews  
The objective is to minimize the number of tardy jobs. In the literature, this problem has been proved to be strongly NP-hard for arbitrary due-dates.  ...  [Yuan, Jin Jiang] (PRC-ZHEN: Zhengzhou A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs. (English summary) J.  ... 

Page 7441 of Mathematical Reviews Vol. , Issue 90M [page]

1990 Mathematical Reviews  
times about a common due date.  ...  Summary: “This paper surveys algorithms for the problem of scheduling jobs on a single machine to minimize total weighted tar- diness.  ... 

Literature Review of Open Shop Scheduling Problems

Ellur Anand, Ramasamy Panneerselvam
2015 Intelligent Information Management  
., minimization of makespan, minimization of sum of completion times of jobs, minimization of sum of weighted completion times of all jobs, minimization of total tardiness of all jobs, minimization of  ...  sum of weighted tardiness of all jobs, minimization of weighted sum of tardy jobs, and miscellaneous measures of the open shop scheduling problem.  ...  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

A Hybrid Genetic Algorithm to Minimize Total Tardiness for Unrelated Parallel Machine Scheduling with Precedence Constraints

Chunfeng Liu
2013 Mathematical Problems in Engineering  
The paper presents a novel hybrid genetic algorithm (HGA) for a deterministic scheduling problem where multiple jobs with arbitrary precedence constraints are processed on multiple unrelated parallel machines  ...  The objective is to minimize total tardiness, since delays of the jobs may lead to punishment cost or cancellation of orders by the clients in many situations.  ...  The author is grateful for the financial supports.  ... 
doi:10.1155/2013/537127 fatcat:o4kcjfgq4vglnbagl2ynsssugy

Modeling and solution methods for hybrid flow shop scheduling problem with job rejection

Mohamadreza Dabiri, Mehdi Yazdani, Bahman Naderi, Hassan Haleh
2021 Operational Research  
This paper addresses the hybrid flow shop scheduling problem by considering job rejection to minimize the sum of the total tardiness cost of the scheduled jobs and total cost of the rejected jobs as a  ...  As well as, in this paper, the problem is viewed from a bi-objective problem perspective, so that the tardiness costs of the scheduled jobs and rejection costs of rejected jobs as two objectives are minimized  ...  Zhong and Ou (2017a, b) developed a PTAS for the scheduling of parallel machines with rejection and various job release dates.  ... 
doi:10.1007/s12351-021-00629-2 fatcat:33sxe5n7znhtxls3fnttt7dg5a

Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work

Malgorzata Sterna, Kateryna Czerniachowska
2017 Journal of Optimization Theory and Applications  
We study the scheduling problem with a common due date on two parallel identical machines and the total early work criterion. The problem is known to be NPhard.  ...  Zhang and Wang [22] studied two-agent scheduling problems, where different agents share a common resource, namely a single machine, and each agent wants to minimize a cost function depending on its jobs  ...  Acknowledgements The authors would like to thank Vitaly A. Strusevich for helpful and valuable suggestions which allowed improving the quality of the paper.  ... 
doi:10.1007/s10957-017-1147-7 fatcat:uej55r4pzzckdj6p56wn6skdsa

A bicriteria approach to scheduling a single machine with job rejection and positional penalties

Dvir Shabtay, Nufar Gaspar, Liron Yedidsion
2010 Journal of combinatorial optimization  
Among these scheduling criteria are the minimization of the makespan, the sum of completion times, the sum and variation of completion times, and the total earliness plus tardiness costs where the due  ...  This paper provides a uni...ed bicriteria analysis of a large set of single machine problems sharing a common property: all problems can be represented by or reduced to a scheduling problem with a scheduling  ...  They have studied the problem on a set of identical parallel machines with the makespan scheduling criterion.  ... 
doi:10.1007/s10878-010-9350-6 fatcat:zii5psuq3fd2vauzk4wngt2q5a

Process Planning and Scheduling with SLK Due-Date Assignment where Earliness, Tardiness and Due-Dates are Punished

Halil Ibrahim Demir, Ozer Uygun, Ibrahim Cil, Mumtaz Ipek, Meral Sari
2014 Journal of Industrial and Intelligent Information  
Some works are done on integrated process planning and scheduling and on scheduling with due-date assignment. However integrating all of these functions is not treated.  ...  Earliness, Tardiness and length of due-dates are punished. While earliness and tardiness are punished quadratically, due-date is punished linearly. Three results were compared.  ...  Tuong and Soukhal [44] studied due date assignment and just-in-time scheduling for single machine and parallel machine problems with equal-size jobs where the objective is to minimize the total weighted  ... 
doi:10.12720/jiii.3.3.173-180 fatcat:3xqhofbfdbd63prwewxamkhoq4
« Previous Showing results 1 — 15 out of 920 results