Filters








2,859 Hits in 7.5 sec

The use of a fuzzy multi-objective linear programming for solving a multi-objective single-machine scheduling problem

Reza Tavakkoli-Moghaddam, Babak Javadi, Fariborz Jolai, Ali Ghodratnama
2010 Applied Soft Computing  
The proposed model attempts to minimize the total weighted tardiness and makespan simultaneously.  ...  This paper develops a fuzzy multi-objective linear programming (FMOLP) model for solving a multiobjective single-machine scheduling problem.  ...  In single-machine scheduling, most research is concerned with minimizing a single criterion.  ... 
doi:10.1016/j.asoc.2009.10.010 fatcat:vji2k5yqofb4bbjlhbrkevrlfq

Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems

Oğuzhan Ahmet ARIK
2019 Journal of Multidisciplinary Modeling and Optimization  
This paper investigates single machine earliness/tardiness problem considering the decision maker's tolerances for earliness and tardiness durations in case of a restrictive common due date.  ...  Then, this paper uses dissatisfaction levels in order to introduce a new objective criterion that minimizes the products of earliness and tardiness durations with dissatisfaction levels.  ...  Li and Zhang [6] considered single machine due date assignment problems where the objective is to minimize the possibilistic mean of total E/T cost with fuzzy processing times and precedence constraints  ... 
doaj:b1f3a22dcb9442d5b29b52a646f5f3a7 fatcat:lkfvhuvosfdbnetgmzevajqq6u

Page 646 of The Journal of the Operational Research Society Vol. 48, Issue 6 [page]

1997 The Journal of the Operational Research Society  
A dual algorithm for the one-machine scheduling problem. Math Program 11: 229-251. Schrage LE and Baker KR (1978). Dynamic programming solution of sequencing problems with precedence constraints.  ...  Minimizing total tardiness on one machine is NP-hard. Math Op Res 15: 483-495. Potts CN and Van Wassenhove LN (1991). Single machine tardiness sequencing heuristics. JE Trans 23: 346-354.  ... 

Minimizing total weighted tardiness for the single machine scheduling problem with dependent setup time and precedence constraints

Hamidreza Haddad, Mohammad Reza Nematollahi
2012 Management Science Letters  
This paper tackles the single machine scheduling problem with dependent setup time and precedence constraints. The primary objective of this paper is minimization of total weighted tardiness.  ...  Because of high sensitivity of GA to its initial values of parameters, a Taguchi approach is presented to calibrate its parameters.  ...  Acknowledgment The authors would like to thank the anonymous referees for the valuable comments on earlier version of this work.  ... 
doi:10.5267/j.msl.2011.12.020 fatcat:uf4ohz34rra4veoofgeo36wlrm

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.  ...  Introduction We consider an unrelated parallel machine scheduling problem with arbitrary precedence constraints to minimize total tardiness.  ... 
doi:10.1155/2013/537127 fatcat:o4kcjfgq4vglnbagl2ynsssugy

Page 7231 of Mathematical Reviews Vol. , Issue 97K [page]

1997 Mathematical Reviews  
Part I deals with the two-machine flow shop problem F2D with delays and Part II consists of three papers published elsewhere, and deals with the problem of minimizing total tardiness on a single machine  ...  The total tardiness problem is defined as follows. Consider a single machine and n jobs j (j = 1,---,m). The machine is available from time zero onwards and can process at most one job at a time.  ... 

Minimizing Total Weighted Tardiness in a Generalized Job Shop

K. M. J. De Bontridder
2005 Journal of Scheduling  
As objective we consider the total weighted tardiness. We use a tabu search algorithm to search for the order in which the operations are processed on each machine.  ...  Given a sequence of operations on each machine, we determine optimal starting times by solving a maximum cost flow problem.  ...  The problem is to assign the operations to time intervals on the machines such that the schedule is feasible and the total weighted tardiness is minimized.  ... 
doi:10.1007/s10951-005-4779-7 fatcat:abc52pqh6fh23pua3zktih6oxu

Page 663 of Mathematical Reviews Vol. , Issue 2004a [page]

2004 Mathematical Reviews  
Summary: “A problem of scheduling jobs nonpreemptively on a single machine subject to time delay constraints and precedence constraints is considered.  ...  Summary: “This paper is concerned with a two-criteria problem in a two-machine flow shop. The objective is to find a job sequence that minimizes both the total flow time and the tardiness.  ... 

Page 88 of The Journal of the Operational Research Society Vol. 48, Issue 1 [page]

1997 The Journal of the Operational Research Society  
On the single machine schedul- ing problem with tardiness penalties, J Op! Res Soc 42: 695- 702. Lawler EL (1977).  ...  An algorithm for the single machine sequencing problem to minimize total tardiness, ITE Transactions 15: 363-366. Sen TT and Borah BN (1991).  ... 

Two Open Problems in Precedence Constrained Scheduling [chapter]

J.K. Lenstra, A.H.G. Rinnooy Kan
1984 North-Holland Mathematics Studies  
Some typical complexity results for such problems are discussed in the light of two prominent open problems in this area: the minimization of total tardiness for unit-time jobs on a single machine subject  ...  to chainlike precedence constraints, and the minimization of maximum completion time for unit-time jobs on three identical parallel machines subject to arbitrary precedence constraints.  ...  ACKNOWLEDGEMENTS We are grateful to D. de Werra who translated our extended abstract into a resume detaille. Our research was supported by NSF grant MCS78-20054.  ... 
doi:10.1016/s0304-0208(08)73838-6 fatcat:vx4kcnyfafavdg72doeyf5hg5u

A linear programming approach for hybrid flexible flow shop with sequence-dependent setup times to minimise total tardiness

S. Oujana, F. Yalaoui, L. Amodeo
2021 IFAC-PapersOnLine  
, machine eligibility, and precedence constraints among jobs, in order to minimize the total tardiness time.  ...  The considered problem is a variation of the classical Flow shop problem, in which specific constraints are jointly considered, such as nonidentical parallel machines, sequence-dependent setups on machines  ...  of minimizing the total tardiness.  ... 
doi:10.1016/j.ifacol.2021.08.207 fatcat:qxyb33jisvgyhfklkh7drt2zvi

Evolving priority scheduling heuristics with genetic programming

Domagoj Jakobović, Kristina Marasović
2012 Applied Soft Computing  
The priority function is used within an appropriate meta-algorithm for a given environment, which forms the priority scheduling heuristic.  ...  Genetic programming is used to evolve the priority function, which determines the priority values of certain system elements (jobs, machines).  ...  machine, static weighted tardiness with precedence constraints.  ... 
doi:10.1016/j.asoc.2012.03.065 fatcat:azpjtfkckjfe5nqgzwypoymzea

A bicriteria scheduling with sequence-dependent setup times

Tamer Eren, Ertan Güner
2006 Applied Mathematics and Computation  
In this paper a multicriteria scheduling problem with sequence-dependent setup times on a single machine is considered.  ...  The objective function of the problem is minimization of the weighted sum of total completion time, maximum tardiness and maximum earliness.  ...  The problem with the objective of minimizing the weighted sum of total completion time, maximum tardiness and maximum earliness with sequencedependent setup times on a single machine is considered in this  ... 
doi:10.1016/j.amc.2005.11.112 fatcat:2gmnjn5jvzdalbcc6afoxk5tty

Approaches to modeling train scheduling problems as job-shop problems with blocking constraints

Julia Lange, Frank Werner
2017 Journal of Scheduling  
A computational study is made on hard instances with up to 20 jobs and 11 machines to compare the MIP models in terms of total tardiness values, formulation size and computation time.  ...  A feasible schedule has to be determined which minimizes total tardiness of all trains at their destinations.  ...  PMA-MIP formulation with precedence variables The job-shop scheduling problem with blocking constraints and minimization of total tardiness can be modeled based on the PMA, applying precedence variables  ... 
doi:10.1007/s10951-017-0526-0 fatcat:zlf2t33iubfvnhz27jcgsefjeu

A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness

J. E. Holsenback, R. M. Russell
1992 Journal of the Operational Research Society  
LEUNG (1990) Minimizing total tardiness on one machine is NP-hard. Math Opns Res. 15, 483-495. . H. Emmons (1969) One machine sequencing to minimize certain functions of job tardiness.  ...  RUSSELL Department of Management Science, The University of South Carolina, USA The problem of minimizing total tardiness assumes that the N jobs to be processed on a single machine are simultaneously  ... 
doi:10.1057/jors.1992.6 fatcat:s5uyk2gvdzdf3fnvhtaj3c6ovi
« Previous Showing results 1 — 15 out of 2,859 results