default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 285
Volume 285, Number 1, February 2020
- Massimiliano Caramia
:
Project management and scheduling. 1-8 - Vijaya Dixit, Manoj Kumar Tiwari:
Project portfolio selection and scheduling optimization based on risk measure: a conditional value at risk approach. 9-33 - David Laurie Hughes, Nripendra P. Rana, Yogesh K. Dwivedi:
Elucidation of IS project success factors: an interpretive structural modelling approach. 35-66 - Yan Zhao, Nanfang Cui, Wendi Tian:
A two-stage approach for the critical chain project rescheduling. 67-95 - Alessandro Agnetis, Cyril Briand, Sandra Ulrich Ngueveu, Premysl Sucha:
Price of anarchy and price of stability in multi-agent project scheduling. 97-119 - Changchun Liu, Xi Xiang, Li Zheng:
Value of information sharing in a multiple producers-distributor supply chain. 121-148 - Joanna Berlinska:
Heuristics for scheduling data gathering with limited base station memory. 149-159 - Farnaz Torabi Yeganeh, Seyed Hessameddin Zegordi:
A multi-objective optimization approach to project scheduling with resiliency criteria under uncertain activity duration. 161-196 - Fernando Jaramillo, Busra Keles, Murat Erkoc:
Modeling single machine preemptive scheduling problems for computational efficiency. 197-222 - Ronghua Meng, Yunqing Rao, Qiang Luo:
Modeling and solving for bi-objective cutting parallel machine scheduling problem. 223-245 - Prahalad Venkateshan, Joseph G. Szmerekovsky, George L. Vairaktarakis:
A cutting plane approach for the multi-machine precedence-constrained scheduling problem. 247-271 - Jean-Paul Arnaout:
A worm optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. 273-293 - Juntaek Hong, Kangbok Lee, Michael L. Pinedo:
Scheduling equal length jobs with eligibility restrictions. 295-314 - Söhnke Maecker, Liji Shen:
Solving parallel machine problems with delivery times and tardiness objectives. 315-334 - Felix Quinton, Idir Hamaz, Laurent Houssin:
A mixed integer linear programming modelling for the flexible cyclic jobshop problem. 335-352 - Olivér Osz, Balázs Ferenczi, Máté Hegyháti:
Scheduling a forge with due dates and die deterioration. 353-367 - Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman:
Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines. 369-395 - Zhi Pei, Mingzhong Wan, Ziteng Wang:
A new approximation algorithm for unrelated parallel machine scheduling with release dates. 397-425 - Amadeu Almeida Coco, Christophe Duhamel, Andréa Cynthia Santos:
Modeling and solving the multi-period disruptions scheduling problem on urban networks. 427-443
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 2025-11-20 22:12 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:
