Filters








30,651 Hits in 5.5 sec

Single Machine Group Scheduling with Two Ordered Criteria

T. C. Edwin Cheng, Mikhail Y. Kovalyov, Alexander V. Tuzikov
1996 Journal of the Operational Research Society  
HOOGEVEEN (1992) Single-Machine Bicriteria Scheduling. Doctoral Thesis, CWI, Amsterdam. . E. L. LAWLER (1973) Optimal sequencing of a single machine subject to precedence constraints.  ...  It is shown that this algorithm can also be modified to solve the single machine group scheduling problem with several ordered maximum cost criteria and arbitrary precedence constraints.  ... 
doi:10.1057/jors.1996.27 fatcat:szi3r2piyzdsrdltqcifsi7oxi

Local search procedures for improving feasible solutions to the sequential ordering problem

L. F. Escudero, A. Sciomachen
1993 Annals of Operations Research  
Nodes represent jobs (to be processed on a single machine), arcs represent sequencing of the jobs, the nodes' weights are the processing time for the jobs, the arcs' weights are the setup times for two  ...  The algorithm is based on two local search r-opt procedures to reduce the makespan while satisfying the time window (i.e. release date and deadline) and precedence constraints, for t¢= 3 and 4.  ...  To summarize, the problem considered in this paper applies to scheduling many jobs on a single machine, with processing times, setup times between jobs (possibly dependent on the sequence), precedence  ... 
doi:10.1007/bf02024937 fatcat:4ar7ypeyhngyzms5topifti4su

Applications of the Lagrangian Relaxation Method to Operations Scheduling [chapter]

Juan José Lavios, José Alberto Arauzo, Ricardo del Olmo, Miguel Ángel Manzanedo
2014 Lecture Notes in Management and Industrial Engineering  
Lagrangian Relaxation method has been applied to solve scheduling problem in diverse manufacturing environments like single machine, parallel machine, flow shop, job shop or even in complex real-world  ...  We highlight two key issues on the application of the method: the first one is about the method to solve the dual problem and second one is the choice of the constraints to relax.  ...  Single machine scheduling problem Sun et al (1999) use Lagrangian Relaxation algorithm to solve the problem of scheduling a single machine with sequence dependent setup time.  ... 
doi:10.1007/978-3-319-04705-8_17 fatcat:3pjhavvkfbdgphrg3rzg2e4khy

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  
This paper develops a fuzzy multi-objective linear programming (FMOLP) model for solving a multiobjective single-machine scheduling problem.  ...  In this problem, a proposed FMOLP method is applied with respect to the overall acceptable degree of the decision maker (DM) satisfaction.  ...  Eren and Güner [8] considered a bi-criteria single-machine scheduling problem with sequence-dependent setup times.  ... 
doi:10.1016/j.asoc.2009.10.010 fatcat:vji2k5yqofb4bbjlhbrkevrlfq

Page 2103 of Mathematical Reviews Vol. , Issue 2001C [page]

2001 Mathematical Reviews  
The paper considers the problem of scheduling a set of jobs on a single machine with given precedence constraints between the jobs such that the weighted sum of completion times of the jobs is minimal.  ...  jobs on a single machine.  ... 

On-line scheduling with precedence constraints

Yossi Azar, Leah Epstein
2002 Discrete Applied Mathematics  
We consider the on-line problem of scheduling jobs with precedence constraints on m machines.  ...  The lower bound should be contrasted with the known bounds for jobs without precedence constraints.  ...  Introduction We consider the on-line problem of scheduling a sequence of jobs with precedence constraints on m parallel machines. A job can be scheduled after all its predecessors are completed.  ... 
doi:10.1016/s0166-218x(01)00272-4 fatcat:yqprd2y7ujgzhdxn7ps7a6x7zq

On-Line Scheduling with Precedence Constraints [chapter]

Yossi Azar, Leah Epstein
2000 Lecture Notes in Computer Science  
We consider the on-line problem of scheduling jobs with precedence constraints on m machines.  ...  The lower bound should be contrasted with the known bounds for jobs without precedence constraints.  ...  Introduction We consider the on-line problem of scheduling a sequence of jobs with precedence constraints on m parallel machines. A job can be scheduled after all its predecessors are completed.  ... 
doi:10.1007/3-540-44985-x_15 fatcat:h7vgrvpthfdrxjzab5soomnz3e

Evolving priority scheduling heuristics with genetic programming

Domagoj Jakobović, Kristina Marasović
2012 Applied Soft Computing  
Genetic programming is used to evolve the priority function, which determines the priority values of certain system elements (jobs, machines).  ...  The evolved solutions are compared with existing scheduling heuristics and found to perform similarly to or better than existing algorithms.  ...  machine, static weighted tardiness with precedence constraints.  ... 
doi:10.1016/j.asoc.2012.03.065 fatcat:azpjtfkckjfe5nqgzwypoymzea

An Experimental Study of Algorithms for Weighted Completion Time Scheduling

I. D. Baev, W. M. Meleis, A. Eichenberger
2002 Algorithmica  
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj P wi Ci.  ...  For these instances with arbitrary precedence constraints, best linear programming-based approach n d s s c hedules that are within 5:7 of optimal.  ...  Sidney 5 shows that for arbitrary precedence constraints, an optimal module-intact single-machine schedule always exists.  ... 
doi:10.1007/s00453-001-0103-x fatcat:5uky5q5mqfe3pk7cldr4u3ohr4

Page 316 of The Journal of the Operational Research Society Vol. 47, Issue 2 [page]

1996 The Journal of the Operational Research Society  
In the following section, Lawler’s'* algorithm for the single machine scheduling problem of mini- mizing the maximum cost subject to precedence constraints is modified to solve our single cri- terion group  ...  scheduling problem with the constructed precedence constraints.  ... 

Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints [chapter]

Václav Lín
2011 Lecture Notes in Computer Science  
Also, we define a troubleshooting scenario with precedence restrictions on the repair actions.  ...  We show that two troubleshooting scenarios -Troubleshooting with Postponed System Test [9] and Troubleshooting with Cost Clusters without Inside Information [7] -are NP-hard.  ...  Troubleshooting with Precedence Constraints We now introduce Single Machine Scheduling with Weighted Completion Time and Precedence Constraints [6] .  ... 
doi:10.1007/978-3-642-22152-1_18 fatcat:qwstmhtd6jf25lmzvxdms4gu4q

Page 406 of The Journal of the Operational Research Society Vol. 43, Issue 5 [page]

1992 The Journal of the Operational Research Society  
Gupta (1988) Single facility scheduling with multiple job classes. Eur. J. Opl Res. 33, 42-45. . K. C. So (1990) Some heuristics for scheduling jobs on parallel machines with setups.  ...  ANDERSON (1991) Minimizing flow time on a single machine with job classes and setup times. Naval Res. Logist. 38, 333-350. . J. N. D.  ... 

A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times [chapter]

G. L. Nemhauser, M. W. P. Savelsbergh
1992 Combinatorial Optimization  
We propose a mixed integer programming formulation for the single machine scheduling problem with release times and the objective of minimizing the weighted sum of the start times.  ...  Abstract We propose a mixed integer programming formulation for the single machine scheduling problem with release times and the objective of minimizing the weighted sum of the start times.  ...  Finally, Wolsey [1989] compared different formulations for the single machine scheduling problem with precedence constraints.  ... 
doi:10.1007/978-3-642-77489-8_4 fatcat:kev7eo5mnnbmrnnoxqytmb7va4

'Strong'–'weak' precedence in scheduling: Extensions to series–parallel orders

Moshe Dror, George Steiner
2010 Discrete Applied Mathematics  
Moreover, for series-parallel posets we establish new computational complexity results for strong precedence constraints for single-and multi-machine problems. Crown  ...  We examine computational complexity implications for scheduling problems with job precedence relations with respect to strong precedence versus weak precedence.  ...  Single-machine problems It is natural to examine how the complexity of a scheduling problem is affected if its weak precedence constraints are replaced by strong precedence.  ... 
doi:10.1016/j.dam.2010.06.015 fatcat:lkdb4tkatzd6zphujfvqdshjy4

A precedence constrained flow shop scheduling problem with transportation time, breakdown times, and weighted jobs

M. Thangaraj, T. Jayanth Kumar, KR. Nandan
2022 Journal of Project Management  
Formally, this scenario is known as precedence constraint, which influences the optimal job sequence.  ...  In addition to that, an ordered precedence constraint is considered that ensures a successor job cannot start on any machine before its predecessor job has been done on all machines.  ...  times, job weights, and precedence constraints.  ... 
doi:10.5267/j.jpm.2022.4.002 fatcat:bcepn6zll5bp3jj4bm2uzozcuq
« Previous Showing results 1 — 15 out of 30,651 results