default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 213
Volume 213, Number 1, February 2014
- Vincent T'kindt, Emmanuel Néron:
Preface. 1 - Lotte Berghman
, Roel Leus, Frits C. R. Spieksma:
Optimal solutions for a dock assignment problem with trailer transportation. 3-25 - Stefan Creemers, Erik Demeulemeester, Stijn Van de Vonder:
A new approach for quantitative risk analysis. 27-65 - Federico Della Croce, Andrea Grosso, Fabio Salassa:
A matheuristic approach for the two-machine total completion time flow shop problem. 67-78 - Donatas Elvikis, Vincent T'kindt:
Two-agent scheduling on uniform parallel machines with min-max criteria. 79-94 - Murat Firat, Cor A. J. Hurkens, Alexandre Laugier:
Stable multi-skill workforce assignments. 95-114 - Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner:
Approximability results for the resource-constrained project scheduling problem with a single type of resources. 115-130 - Stanislaw Gawiejnowicz, Alexander V. Kononov:
Isomorphic scheduling problems. 131-145 - Olivier Guyon, Pierre Lemaire, Eric Pinson, David Rivreau:
Solving an integrated job-shop problem with human resource constraints. 147-171 - Navid Hashemian, Claver Diallo, Béla Vizvári:
Makespan minimization for parallel machines scheduling with multiple availability constraints. 173-186 - Öncü Hazir, Safia Kedad-Sidhoum:
Batch sizing and just-in-time scheduling with common due date. 187-202 - Zhengwen He, Nengmin Wang, Pengxiang Li:
Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective. 203-220 - Ali Obeid, Stéphane Dauzère-Pérès, Claude Yugma:
Scheduling job families on non-identical parallel machines with time constraints. 221-234 - Rafal Rózycki, Jan Weglarz:
Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan. 235-252 - Sergey Sevastyanov, D. A. Chemisova, Ilya Chernykh:
On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion. 253-270 - Wendi Tian, Erik Demeulemeester:
Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment. 271-291 - Christian Viergutz, Sigrid Knust:
Integrated production and distribution scheduling with lifespan constraints. 293-318 - Grzegorz Waligóra:
Discrete-continuous project scheduling with discounted cash inflows and various payment models - a review of recent results. 319-340
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-07 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
