The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
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). ...
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  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
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
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. ...
-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. ...
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
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
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. ...
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. ...
., 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
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
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
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  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
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
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  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