Search Results - subject:"precedence constraints"

Flexible job-shop scheduling problems with "AND"/"OR" precedence constraints

Lee, Sanghyup; Moon, Ilkyeong; Bae, Hyerim; Kim, Jion - In: International journal of production research 50 (2012) 7, pp. 1979-2001

Persistent link: https://www.econbiz.de/10009563773

New neighborhood structures for the Double Traveling Salesman Problem with Multiple Stacks

Felipe, A.; Ortuño, M.; Tirado, G. - In: TOP: An Official Journal of the Spanish Society of … 17 (2009) 1, pp. 190-213

Persistent link: https://www.econbiz.de/10004995460

Minimizing total weighted completion times subject to precedence constraints by dynamic programming

Drexl, Andreas; Kimms, Alf - 1998

In this paper we present a polynomial time dynamic programming algorithm for solving a scheduling problem with a (total) weighted completion time objective function where the weights are activity- and time-dependent. We highlight application areas for this type of problem to underscore the...

Persistent link: https://www.econbiz.de/10011558733

Minimizing total weighted completion times subject to precedence constraints by dynamic programming

Drexl, Andreas; Kimms, Alf - 1998

Persistent link: https://www.econbiz.de/10011737310

PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES

ZINDER, YAKOV; SINGH, GAURAV - In: Asia-Pacific Journal of Operational Research (APJOR) 22 (2005) 04, pp. 445-462

the problem with two processors and arbitrary precedence constraints, and for the problem with an arbitrary number of … processors and precedence constraints in the form of an in-tree. This proof also indicates that the presented algorithm allows …The paper presents a priority algorithm for the maximum lateness problem with parallel identical processors, precedence …

Persistent link: https://www.econbiz.de/10005080655

Reachability cuts for the vehicle routing problem with time windows

Lysgaard, Jens - Ehrvervøkonomisk Institut, Institut for Økonomi - 2004

(VRPTW). Reachability cuts are closely related to cuts derived <p> from precedence constraints in the Asymmetric Traveling …

Persistent link: https://www.econbiz.de/10005802218

Linear preselective policies for stochastic project scheduling

Möhring, Rolf H.; Stork, Frederik - In: Mathematical Methods of Operations Research 52 (2000) 3, pp. 501-515

<Emphasis Type="SmallCaps">and/<Emphasis Type="SmallCaps">or precedence constraints we derive efficient algorithms for computing …

Persistent link: https://www.econbiz.de/10010999933

A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints

Dorndorf, Ulrich; Pesch, Erwin; Phan-Huy, Toàn - In: Management Science 46 (2000) 10, pp. 1365-1384

Resource-constrained project scheduling with generalised precedence constraints is a very general scheduling model with …

Persistent link: https://www.econbiz.de/10009214375

Linear preselective policies for stochastic project scheduling

Möhring, Rolf H.; Stork, Frederik - In: Computational Statistics 52 (2000) 3, pp. 501-515

and/ or precedence constraints we derive efficient algorithms for computing earliest job start times and state a necessary …

Persistent link: https://www.econbiz.de/10010759526

Scheduling identical jobs with chain precedence constraints on two uniform machines

Brucker, Peter; Hurink, Johann; Kubiak, Wieslaw - In: Computational Statistics 49 (1999) 2, pp. 211-219

The problem of scheduling identical jobs with chain precedence constraints on two uniform machines is considered. It is …

Persistent link: https://www.econbiz.de/10010847645