Bendotti, Pascale; Chrétienne, Philippe; Fouilhoux, Pierre; Pass-Lanneau, Adèle Anchored rescheduling problems under generalized precedence constraints. (English) Zbl 07306390 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 156-166 (2020). MSC: 90B35 PDF BibTeX XML Cite \textit{P. Bendotti} et al., Lect. Notes Comput. Sci. 12176, 156--166 (2020; Zbl 07306390) Full Text: DOI
Happach, Felix; Schulz, Andreas S. Precedence-constrained scheduling and min-sum set cover (extended Abstract). (English) Zbl 07238566 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 170-187 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{F. Happach} and \textit{A. S. Schulz}, Lect. Notes Comput. Sci. 11926, 170--187 (2020; Zbl 07238566) Full Text: DOI
Fotakis, Dimitris; Milis, Ioannis; Papadigenopoulos, Orestis; Vassalos, Vasilis; Zois, Georgios Scheduling MapReduce jobs on identical and unrelated processors. (English) Zbl 1446.68023 Theory Comput. Syst. 64, No. 5, 754-782 (2020). MSC: 68M20 68W25 PDF BibTeX XML Cite \textit{D. Fotakis} et al., Theory Comput. Syst. 64, No. 5, 754--782 (2020; Zbl 1446.68023) Full Text: DOI
Salman, Raad; Ekstedt, Fredrik; Damaschke, Peter Branch-and-bound for the precedence constrained generalized traveling salesman problem. (English) Zbl 07186957 Oper. Res. Lett. 48, No. 2, 163-166 (2020). MSC: 90 PDF BibTeX XML Cite \textit{R. Salman} et al., Oper. Res. Lett. 48, No. 2, 163--166 (2020; Zbl 07186957) Full Text: DOI
Heath, Emily A.; Mitchell, John E.; Sharkey, Thomas C. Scheduling of tasks with effectiveness precedence constraints. (English) Zbl 1433.90063 Optim. Lett. 14, No. 1, 37-49 (2020). MSC: 90B35 PDF BibTeX XML Cite \textit{E. A. Heath} et al., Optim. Lett. 14, No. 1, 37--49 (2020; Zbl 1433.90063) Full Text: DOI
Hanafi, Saïd; Mansini, Renata; Zanotti, Roberto The multi-visit team orienteering problem with precedence constraints. (English) Zbl 1430.90086 Eur. J. Oper. Res. 282, No. 2, 515-529 (2020). MSC: 90B06 90C11 90C35 90C57 PDF BibTeX XML Cite \textit{S. Hanafi} et al., Eur. J. Oper. Res. 282, No. 2, 515--529 (2020; Zbl 1430.90086) Full Text: DOI
Emde, Simon; Polten, Lukas; Gendreau, Michel Logic-based benders decomposition for scheduling a batching machine. (English) Zbl 07128384 Comput. Oper. Res. 113, Article ID 104777, 12 p. (2020). MSC: 90B PDF BibTeX XML Cite \textit{S. Emde} et al., Comput. Oper. Res. 113, Article ID 104777, 12 p. (2020; Zbl 07128384) Full Text: DOI
Ait Haddadene, Syrine Roufaida; Labadie, Nacima; Prodhon, Caroline Bicriteria vehicle routing problem with preferences and timing constraints in home health care services. (English) Zbl 07257772 Algorithms (Basel) 12, No. 8, Paper No. 152, 25 p. (2019). MSC: 90 92 PDF BibTeX XML Cite \textit{S. R. Ait Haddadene} et al., Algorithms (Basel) 12, No. 8, Paper No. 152, 25 p. (2019; Zbl 07257772) Full Text: DOI
Nagarajan, Viswanath; Wolf, Joel; Balmin, Andrey; Hildrum, Kirsten Malleable scheduling for flows of jobs and applications to MapReduce. (English) Zbl 1434.90065 J. Sched. 22, No. 4, 393-411 (2019). MSC: 90B35 68M20 68W25 PDF BibTeX XML Cite \textit{V. Nagarajan} et al., J. Sched. 22, No. 4, 393--411 (2019; Zbl 1434.90065) Full Text: DOI
Miyake, Fumito; Takimoto, Eiji; Hatano, Kohei Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints. (English) Zbl 07173545 Colbourn, Charles J. (ed.) et al., Combinatorial algorithms. 30th international workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-25004-1/pbk; 978-3-030-25005-8/ebook). Lecture Notes in Computer Science 11638, 365-377 (2019). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{F. Miyake} et al., Lect. Notes Comput. Sci. 11638, 365--377 (2019; Zbl 07173545) Full Text: DOI
Wang, Tianyu; Bellenguez-Morineau, Odile A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time. (English) Zbl 1432.90066 J. Sched. 22, No. 6, 709-714 (2019). MSC: 90B35 68M20 PDF BibTeX XML Cite \textit{T. Wang} and \textit{O. Bellenguez-Morineau}, J. Sched. 22, No. 6, 709--714 (2019; Zbl 1432.90066) Full Text: DOI
Wang, Tianyu; Bellenguez-Morineau, Odile The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints. (English) Zbl 1427.90161 J. Sched. 22, No. 3, 263-269 (2019). MSC: 90B35 68M20 PDF BibTeX XML Cite \textit{T. Wang} and \textit{O. Bellenguez-Morineau}, J. Sched. 22, No. 3, 263--269 (2019; Zbl 1427.90161) Full Text: DOI
Ding, Yulong; Xin, Bin; Chen, Jie Precedence-constrained path planning of messenger UAV for air-ground coordination. (English) Zbl 1438.90283 Control Theory Technol. 17, No. 1, 13-23 (2019). MSC: 90C27 90C29 PDF BibTeX XML Cite \textit{Y. Ding} et al., Control Theory Technol. 17, No. 1, 13--23 (2019; Zbl 1438.90283) Full Text: DOI
Rostami, Salim; Creemers, Stefan; Leus, Roel Precedence theorems and dynamic programming for the single-machine weighted tardiness problem. (English) Zbl 1403.90362 Eur. J. Oper. Res. 272, No. 1, 43-49 (2019). MSC: 90B35 90C39 PDF BibTeX XML Cite \textit{S. Rostami} et al., Eur. J. Oper. Res. 272, No. 1, 43--49 (2019; Zbl 1403.90362) Full Text: DOI
Salii, Yaroslav Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization. (English) Zbl 1403.90587 Eur. J. Oper. Res. 272, No. 1, 32-42 (2019). MSC: 90C27 90C39 PDF BibTeX XML Cite \textit{Y. Salii}, Eur. J. Oper. Res. 272, No. 1, 32--42 (2019; Zbl 1403.90587) Full Text: DOI
Matsumoto, Kosuke; Hatano, Kohei; Takimoto, Eiji Decision diagrams for solving a job scheduling problem under precedence constraints. (English) Zbl 07286678 D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-070-5). LIPIcs – Leibniz International Proceedings in Informatics 103, Article 5, 12 p. (2018). MSC: 68Wxx PDF BibTeX XML Cite \textit{K. Matsumoto} et al., LIPIcs -- Leibniz Int. Proc. Inform. 103, Article 5, 12 p. (2018; Zbl 07286678) Full Text: DOI
Chentsov, Alexander G.; Grigoriev, Alexey M.; Chentsov, Alexey A. Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions. (English) Zbl 1448.90015 Ural Math. J. 4, No. 2, 43-55 (2018). MSC: 90B06 90B10 90C39 PDF BibTeX XML Cite \textit{A. G. Chentsov} et al., Ural Math. J. 4, No. 2, 43--55 (2018; Zbl 1448.90015) Full Text: DOI MNR
Jäger, Sven Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates. (English) Zbl 07165717 Oper. Res. Lett. 46, No. 5, 505-509 (2018). MSC: 90 PDF BibTeX XML Cite \textit{S. Jäger}, Oper. Res. Lett. 46, No. 5, 505--509 (2018; Zbl 07165717) Full Text: DOI
Sitters, René; Yang, Liya A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective. (English) Zbl 07064581 Oper. Res. Lett. 46, No. 4, 438-442 (2018). MSC: 90 PDF BibTeX XML Cite \textit{R. Sitters} and \textit{L. Yang}, Oper. Res. Lett. 46, No. 4, 438--442 (2018; Zbl 07064581) Full Text: DOI
Li, Jinquan; Xu, Dehua; Li, Hongxing Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment. (English) Zbl 1417.90080 Iran. J. Fuzzy Syst. 15, No. 6, 121-143 (2018). MSC: 90B35 68M20 68Q25 PDF BibTeX XML Cite \textit{J. Li} et al., Iran. J. Fuzzy Syst. 15, No. 6, 121--143 (2018; Zbl 1417.90080) Full Text: DOI
Prot, D.; Bellenguez-Morineau, O. A survey on how the structure of precedence constraints may change the complexity class of scheduling problems. (English) Zbl 1406.90006 J. Sched. 21, No. 1, 3-16 (2018). MSC: 90-02 90B35 68M20 PDF BibTeX XML Cite \textit{D. Prot} and \textit{O. Bellenguez-Morineau}, J. Sched. 21, No. 1, 3--16 (2018; Zbl 1406.90006) Full Text: DOI
Chentsov, A. G.; Grigoryev, A. M.; Chentsov, A. A. Solving a routing problem with the aid of an independent computations scheme. (English) Zbl 1409.90157 Vestn. Yuzhno-Ural. Gos. Univ., Ser. Mat. Model. Program. 11, No. 1, 60-74 (2018). MSC: 90C27 90C39 PDF BibTeX XML Cite \textit{A. G. Chentsov} et al., Vestn. Yuzhno-Ural. Gos. Univ., Ser. Mat. Model. Program. 11, No. 1, 60--74 (2018; Zbl 1409.90157) Full Text: DOI MNR
Ritt, Marcus; Costa, Alysson M. Improved integer programming models for simple assembly line balancing and related problems. (English) Zbl 1395.90188 Int. Trans. Oper. Res. 25, No. 4, 1345-1359 (2018). MSC: 90C10 90C90 PDF BibTeX XML Cite \textit{M. Ritt} and \textit{A. M. Costa}, Int. Trans. Oper. Res. 25, No. 4, 1345--1359 (2018; Zbl 1395.90188) Full Text: DOI arXiv
Gouveia, Luis; Pesneau, Pierre; Ruthmair, Mario; Santos, Daniel Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem. (English) Zbl 1394.90481 Networks 71, No. 4, 451-465 (2018). MSC: 90C27 90C55 90C11 90C05 90C35 90B10 PDF BibTeX XML Cite \textit{L. Gouveia} et al., Networks 71, No. 4, 451--465 (2018; Zbl 1394.90481) Full Text: DOI
Chai, Xing; Li, Wenhua Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan. (English) Zbl 1400.90166 J. Comb. Optim. 36, No. 2, 472-492 (2018). MSC: 90B35 PDF BibTeX XML Cite \textit{X. Chai} and \textit{W. Li}, J. Comb. Optim. 36, No. 2, 472--492 (2018; Zbl 1400.90166) Full Text: DOI
Chentsov, A. G.; Chentsov, A. A. A discrete-continuous routing problem with precedence constraints. (English. Russian original) Zbl 1391.93120 Proc. Steklov Inst. Math. 300, Suppl. 1, S56-S71 (2018); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 22, No. 4, 275-292 (2016). MSC: 93C25 93B40 PDF BibTeX XML Cite \textit{A. G. Chentsov} and \textit{A. A. Chentsov}, Proc. Steklov Inst. Math. 300, S56--S71 (2018; Zbl 1391.93120); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 22, No. 4, 275--292 (2016) Full Text: DOI
Grabisch, Michel; Sudhölter, Peter On a class of vertices of the core. (English) Zbl 1400.91020 Games Econ. Behav. 108, 541-557 (2018). MSC: 91A12 PDF BibTeX XML Cite \textit{M. Grabisch} and \textit{P. Sudhölter}, Games Econ. Behav. 108, 541--557 (2018; Zbl 1400.91020) Full Text: DOI
Gusmeroli, Nicoló Machine scheduling to minimize weighted completion times. The use of the \(\alpha\)-point. (English) Zbl 1395.90003 SpringerBriefs in Mathematics. Cham: Springer (ISBN 978-3-319-77527-2/pbk; 978-3-319-77528-9/ebook). xi, 53 p. (2018). Reviewer: Svetlana A. Kravchenko (Minsk) MSC: 90-02 90B35 90C27 90C59 68Q25 68M20 68W20 68W25 68W40 PDF BibTeX XML Cite \textit{N. Gusmeroli}, Machine scheduling to minimize weighted completion times. The use of the \(\alpha\)-point. Cham: Springer (2018; Zbl 1395.90003) Full Text: DOI
Furtado, Maria Gabriela S.; Munari, Pedro; Morabito, Reinaldo Pickup and delivery problem with time windows: a new compact two-index formulation. (English) Zbl 1409.90033 Oper. Res. Lett. 45, No. 4, 334-341 (2017). MSC: 90B06 90-08 PDF BibTeX XML Cite \textit{M. G. S. Furtado} et al., Oper. Res. Lett. 45, No. 4, 334--341 (2017; Zbl 1409.90033) Full Text: DOI
Chentsov, Aleksandr Georgievich; Chentsov, Alekseĭ Aleksandrovich; Grigoryev, Alekseĭ Mikhaĭlovich On one routing problem modeling movement in radiation fields. (Russian. English summary) Zbl 1401.90251 Vestn. Udmurt. Univ., Mat. Mekh. Komp’yut. Nauki 27, No. 4, 540-557 (2017). MSC: 90C39 PDF BibTeX XML Cite \textit{A. G. Chentsov} et al., Vestn. Udmurt. Univ., Mat. Mekh. Komp'yut. Nauki 27, No. 4, 540--557 (2017; Zbl 1401.90251) Full Text: DOI MNR
Li, Jinquan Minimizing the total weighted completion time for the relocation scheduling problems with precedence constraints. (Chinese. English summary) Zbl 1399.90096 Math. Numer. Sin. 39, No. 4, 421-430 (2017). MSC: 90B35 PDF BibTeX XML Cite \textit{J. Li}, Math. Numer. Sin. 39, No. 4, 421--430 (2017; Zbl 1399.90096)
Gao, Yuan; Yuan, Jinjiang Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints. (English) Zbl 1387.90088 Discrete Optim. 25, 105-119 (2017). MSC: 90B35 90C29 68M20 PDF BibTeX XML Cite \textit{Y. Gao} and \textit{J. Yuan}, Discrete Optim. 25, 105--119 (2017; Zbl 1387.90088) Full Text: DOI
Rustogi, Kabir; Strusevich, Vitaly A. Single machine scheduling with a generalized job-dependent cumulative effect. (English) Zbl 1386.90063 J. Sched. 20, No. 6, 583-592 (2017). MSC: 90B35 68M20 PDF BibTeX XML Cite \textit{K. Rustogi} and \textit{V. A. Strusevich}, J. Sched. 20, No. 6, 583--592 (2017; Zbl 1386.90063) Full Text: DOI
Bianco, Lucio; Caramia, Massimiliano The resource constrained project scheduling problem: a theoretical comparison between a recent formulation and the main time indexed linear programming based approaches. (English) Zbl 1384.90064 RAIRO, Oper. Res. 51, No. 3, 519-532 (2017). MSC: 90C11 90B35 90C90 PDF BibTeX XML Cite \textit{L. Bianco} and \textit{M. Caramia}, RAIRO, Oper. Res. 51, No. 3, 519--532 (2017; Zbl 1384.90064) Full Text: DOI
Petunin, Aleksandr Aleksandrovich; Chentsov, Aleksandr Georgievich; Chentsov, Pavel Aleksandrovich About routing in the sheet cutting. (Russian. English summary) Zbl 1377.93118 Vestn. Yuzhno-Ural. Gos. Univ., Ser. Mat. Model. Program. 10, No. 3, 25-39 (2017). MSC: 93C95 90B30 93A30 93B40 90C39 PDF BibTeX XML Cite \textit{A. A. Petunin} et al., Vestn. Yuzhno-Ural. Gos. Univ., Ser. Mat. Model. Program. 10, No. 3, 25--39 (2017; Zbl 1377.93118) Full Text: DOI MNR
Przybylski, Bartłomiej Precedence constrained parallel-machine scheduling of position-dependent jobs. (English) Zbl 1380.90125 Optim. Lett. 11, No. 7, 1273-1281 (2017). MSC: 90B35 PDF BibTeX XML Cite \textit{B. Przybylski}, Optim. Lett. 11, No. 7, 1273--1281 (2017; Zbl 1380.90125) Full Text: DOI
Kenkre, Sreyash; Pandit, Vinayaka; Purohit, Manish; Saket, Rishi On the approximability of digraph ordering. (English) Zbl 1372.68302 Algorithmica 78, No. 4, 1182-1205 (2017). MSC: 68W25 05C20 05C85 90C35 PDF BibTeX XML Cite \textit{S. Kenkre} et al., Algorithmica 78, No. 4, 1182--1205 (2017; Zbl 1372.68302) Full Text: DOI
McCormick, S. Thomas; Peis, Britta; Verschae, José; Wierz, Andreas Primal-dual algorithms for precedence constrained covering problems. (English) Zbl 1372.68303 Algorithmica 78, No. 3, 771-787 (2017). MSC: 68W25 90C10 90C27 90C59 PDF BibTeX XML Cite \textit{S. T. McCormick} et al., Algorithmica 78, No. 3, 771--787 (2017; Zbl 1372.68303) Full Text: DOI
Petunin, A. A.; Chentsov, A. A.; Chentsov, A. G.; Chentsov, P. A. Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints. (English. Russian original) Zbl 1366.90209 Autom. Remote Control 78, No. 4, 666-681 (2017); translation from Avtom. Telemekh. 2017, No. 4, 106-125 (2017). MSC: 90C39 PDF BibTeX XML Cite \textit{A. A. Petunin} et al., Autom. Remote Control 78, No. 4, 666--681 (2017; Zbl 1366.90209); translation from Avtom. Telemekh. 2017, No. 4, 106--125 (2017) Full Text: DOI
Kozik, Andrzej Handling precedence constraints in scheduling problems by the sequence pair representation. (English) Zbl 1362.90199 J. Comb. Optim. 33, No. 2, 445-472 (2017). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{A. Kozik}, J. Comb. Optim. 33, No. 2, 445--472 (2017; Zbl 1362.90199) Full Text: DOI
Skutella, Martin A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective. (English) Zbl 1408.90140 Oper. Res. Lett. 44, No. 5, 676-679 (2016). MSC: 90B35 68W25 90C60 PDF BibTeX XML Cite \textit{M. Skutella}, Oper. Res. Lett. 44, No. 5, 676--679 (2016; Zbl 1408.90140) Full Text: DOI arXiv
Schulz, Andreas S.; Verschae, José Min-sum scheduling under precedence constraints. (English) Zbl 1397.90191 Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 74, 13 p. (2016). MSC: 90B35 68W25 90C59 PDF BibTeX XML Cite \textit{A. S. Schulz} and \textit{J. Verschae}, LIPIcs -- Leibniz Int. Proc. Inform. 57, Article 74, 13 p. (2016; Zbl 1397.90191) Full Text: DOI
Chentsov, Alexander G.; Grigoryev, Alexey M. A scheme of independent calculations in a precedence constrained routing problem. (English) Zbl 1388.90016 Kochetov, Yury (ed.) et al., Discrete optimization and operations research. 9th international conference, DOOR 2016, Vladivostok, Russia, September 19–23, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-44913-5/pbk; 978-3-319-44914-2/ebook). Lecture Notes in Computer Science 9869, 121-135 (2016). MSC: 90B06 90C39 PDF BibTeX XML Cite \textit{A. G. Chentsov} and \textit{A. M. Grigoryev}, Lect. Notes Comput. Sci. 9869, 121--135 (2016; Zbl 1388.90016) Full Text: DOI
Hassan, Mohammed-Albarra; Kacem, Imed; Martin, Sébastien; Osman, Izzeldin M. Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut. (English) Zbl 1451.90060 Cerulli, Raffaele (ed.) et al., Combinatorial optimization. 4th international symposium, ISCO 2016, Vietri sul Mare, Italy, May 16–18, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9849, 308-319 (2016). MSC: 90B35 90C57 PDF BibTeX XML Cite \textit{M.-A. Hassan} et al., Lect. Notes Comput. Sci. 9849, 308--319 (2016; Zbl 1451.90060) Full Text: DOI
Letchford, Adam N.; Salazar-González, Juan-José Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem. (English) Zbl 1346.90709 Eur. J. Oper. Res. 251, No. 1, 74-84 (2016). MSC: 90C27 90B10 90C57 PDF BibTeX XML Cite \textit{A. N. Letchford} and \textit{J.-J. Salazar-González}, Eur. J. Oper. Res. 251, No. 1, 74--84 (2016; Zbl 1346.90709) Full Text: DOI
Pereira, Jordi Procedures for the bin packing problem with precedence constraints. (English) Zbl 1346.90716 Eur. J. Oper. Res. 250, No. 3, 794-806 (2016). MSC: 90C27 90C39 PDF BibTeX XML Cite \textit{J. Pereira}, Eur. J. Oper. Res. 250, No. 3, 794--806 (2016; Zbl 1346.90716) Full Text: DOI
Grabisch, Michel; Sudhölter, Peter Characterizations of solutions for games with precedence constraints. (English) Zbl 1388.91025 Int. J. Game Theory 45, No. 1-2, 269-290 (2016). MSC: 91A12 PDF BibTeX XML Cite \textit{M. Grabisch} and \textit{P. Sudhölter}, Int. J. Game Theory 45, No. 1--2, 269--290 (2016; Zbl 1388.91025) Full Text: DOI
Gouveia, Luis; Ruthmair, Mario Load-dependent and precedence-based models for pickup and delivery problems. (English) Zbl 1349.90087 Comput. Oper. Res. 63, 56-71 (2015). MSC: 90B06 90B10 90C35 PDF BibTeX XML Cite \textit{L. Gouveia} and \textit{M. Ruthmair}, Comput. Oper. Res. 63, 56--71 (2015; Zbl 1349.90087) Full Text: DOI
Yan, Ji; Li, Xiangmin; Liu, Bo Multi-agents cooperative task allocation with precedence constraints. (Chinese. English summary) Zbl 1349.93024 Control Decis. 30, No. 11, 1999-2003 (2015). MSC: 93A14 90B35 90C29 68T42 PDF BibTeX XML Cite \textit{J. Yan} et al., Control Decis. 30, No. 11, 1999--2003 (2015; Zbl 1349.93024) Full Text: DOI
Wierz, Andreas; Peis, Britta; Mccormick, S. Thomas Primal-dual algorithms for precedence constrained covering problems. (English) Zbl 06512671 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 12th international workshop, WAOA 2014, Wrocław, Poland, September 11–12, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-18262-9/pbk; 978-3-319-18263-6/ebook). Lecture Notes in Computer Science 8952, 260-272 (2015). MSC: 68W25 90C10 90C27 90C59 PDF BibTeX XML Cite \textit{A. Wierz} et al., Lect. Notes Comput. Sci. 8952, 260--272 (2015; Zbl 06512671) Full Text: DOI
Chentsov, A. G.; Salii, Ya. V. A model of nonadditive routing problem where the costs depend on the set of pending tasks. (English) Zbl 1327.90408 Vestn. Yuzhno-Ural. Gos. Univ., Ser. Mat. Model. Program. 8, No. 1, 24-45 (2015). MSC: 90C90 90C39 PDF BibTeX XML Cite \textit{A. G. Chentsov} and \textit{Ya. V. Salii}, Vestn. Yuzhno-Ural. Gos. Univ., Ser. Mat. Model. Program. 8, No. 1, 24--45 (2015; Zbl 1327.90408) Full Text: DOI
Zinder, Y.; Walker, S. Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness. (English) Zbl 1330.90041 Discrete Appl. Math. 196, 28-53 (2015). MSC: 90B35 PDF BibTeX XML Cite \textit{Y. Zinder} and \textit{S. Walker}, Discrete Appl. Math. 196, 28--53 (2015; Zbl 1330.90041) Full Text: DOI
Berger, André; Grigoriev, Alexander; Heggernes, Pinar; van der Zwaan, Ruben Scheduling unit-length jobs with precedence constraints of small height. (English) Zbl 1408.90120 Oper. Res. Lett. 42, No. 2, 166-172 (2014). MSC: 90B35 68Q25 68W40 90C35 PDF BibTeX XML Cite \textit{A. Berger} et al., Oper. Res. Lett. 42, No. 2, 166--172 (2014; Zbl 1408.90120) Full Text: DOI
Sarin, Subhash C.; Sherali, Hanif D.; Judd, Jason D.; Tsai, Pei-Fang (Jennifer) Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations. (English) Zbl 1348.90011 Comput. Oper. Res. 51, 64-89 (2014). MSC: 90-04 90C27 90C35 PDF BibTeX XML Cite \textit{S. C. Sarin} et al., Comput. Oper. Res. 51, 64--89 (2014; Zbl 1348.90011) Full Text: DOI
Saliĭ, Ya. V. On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems. (Russian. English summary) Zbl 1299.90286 Vestn. Udmurt. Univ., Mat. Mekh. Komp’yut. Nauki 2014, No. 1, 76-86 (2014). MSC: 90C27 90C60 90C39 PDF BibTeX XML Cite \textit{Ya. V. Saliĭ}, Vestn. Udmurt. Univ., Mat. Mekh. Komp'yut. Nauki 2014, No. 1, 76--86 (2014; Zbl 1299.90286) Full Text: DOI MNR
Boyer, Vincent; Gendron, Bernard; Rousseau, Louis-Martin A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem. (English) Zbl 1297.90032 J. Sched. 17, No. 2, 185-197 (2014). MSC: 90B35 90C57 68Q42 PDF BibTeX XML Cite \textit{V. Boyer} et al., J. Sched. 17, No. 2, 185--197 (2014; Zbl 1297.90032) Full Text: DOI
Günther, Elisabeth; König, Felix G.; Megow, Nicole Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width. (English) Zbl 1286.90127 J. Comb. Optim. 27, No. 1, 164-181 (2014). MSC: 90C27 90B35 PDF BibTeX XML Cite \textit{E. Günther} et al., J. Comb. Optim. 27, No. 1, 164--181 (2014; Zbl 1286.90127) Full Text: DOI
Tanaka, Shunji; Sato, Shun An exact algorithm for the precedence-constrained single-machine scheduling problem. (English) Zbl 1317.90132 Eur. J. Oper. Res. 229, No. 2, 345-352 (2013). MSC: 90B35 PDF BibTeX XML Cite \textit{S. Tanaka} and \textit{S. Sato}, Eur. J. Oper. Res. 229, No. 2, 345--352 (2013; Zbl 1317.90132) Full Text: DOI
Chentsov, A. A.; Chentsov, A. G. On an iterative procedure for solving a routing problem with constraints. (English. Russian original) Zbl 1302.90170 Proc. Steklov Inst. Math. 283, Suppl. 1, S24-S45 (2013); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 18, No. 3, 261-281 (2012). MSC: 90C27 90-04 90C35 90C39 65K10 PDF BibTeX XML Cite \textit{A. A. Chentsov} and \textit{A. G. Chentsov}, Proc. Steklov Inst. Math. 283, S24--S45 (2013; Zbl 1302.90170); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 18, No. 3, 261--281 (2012) Full Text: DOI
Prot, D.; Rapine, C. Approximations for the two-machine cross-docking flow shop problem. (English) Zbl 1286.90065 Discrete Appl. Math. 161, No. 13-14, 2107-2119 (2013). MSC: 90B35 05C90 68W25 PDF BibTeX XML Cite \textit{D. Prot} and \textit{C. Rapine}, Discrete Appl. Math. 161, No. 13--14, 2107--2119 (2013; Zbl 1286.90065) Full Text: DOI
Schutt, Andreas; Feydy, Thibaut; Stuckey, Peter J.; Wallace, Mark G. Solving RCPSP/max by lazy clause generation. (English) Zbl 1280.90067 J. Sched. 16, No. 3, 273-289 (2013). MSC: 90B35 68M20 90C09 PDF BibTeX XML Cite \textit{A. Schutt} et al., J. Sched. 16, No. 3, 273--289 (2013; Zbl 1280.90067) Full Text: DOI
Walker, Sam; Zinder, Yakov The solvable cases of a scheduling algorithm. (English) Zbl 1407.90177 Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16–18, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8283, 229-239 (2013). MSC: 90B35 PDF BibTeX XML Cite \textit{S. Walker} and \textit{Y. Zinder}, Lect. Notes Comput. Sci. 8283, 229--239 (2013; Zbl 1407.90177) Full Text: DOI
Zinder, Yakov; Memar, Julia; Singh, Gaurav Discrete optimization with polynomially detectable boundaries and restricted level sets. (English) Zbl 1268.90034 J. Comb. Optim. 25, No. 2, 308-325 (2013). MSC: 90C10 90B35 PDF BibTeX XML Cite \textit{Y. Zinder} et al., J. Comb. Optim. 25, No. 2, 308--325 (2013; Zbl 1268.90034) Full Text: DOI
Kats, Vladimir; Levner, Eugene A note on periodic schedules for linear precedence constraints. (English) Zbl 1255.90061 Discrete Appl. Math. 161, No. 3, 430-434 (2013). MSC: 90B35 90C35 90C05 PDF BibTeX XML Cite \textit{V. Kats} and \textit{E. Levner}, Discrete Appl. Math. 161, No. 3, 430--434 (2013; Zbl 1255.90061) Full Text: DOI
Gordon, Valery; Strusevich, Vitaly; Dolgui, Alexandre Scheduling with due date assignment under special conditions on job processing. (English) Zbl 1280.90049 J. Sched. 15, No. 4, 447-456 (2012). MSC: 90B35 PDF BibTeX XML Cite \textit{V. Gordon} et al., J. Sched. 15, No. 4, 447--456 (2012; Zbl 1280.90049) Full Text: DOI
Bu, Xianmin; Cao, Lixia; Liu, Cengceng The composition chain algorithm and a class of single batch machine scheduling problems with chain precedence constraints. (Chinese. English summary) Zbl 1289.90075 J. Luoyang Inst. Sci. Technol., Nat. Sci. 22, No. 4, 79-83 (2012). MSC: 90B35 PDF BibTeX XML Cite \textit{X. Bu} et al., J. Luoyang Inst. Sci. Technol., Nat. Sci. 22, No. 4, 79--83 (2012; Zbl 1289.90075) Full Text: DOI
Dell’Amico, Mauro; Díaz, José Carlos Díaz; Iori, Manuel The bin packing problem with precedence constraints. (English) Zbl 1269.90092 Oper. Res. 60, No. 6, 1491-1504 (2012). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{M. Dell'Amico} et al., Oper. Res. 60, No. 6, 1491--1504 (2012; Zbl 1269.90092) Full Text: DOI
Agnetis, Alessandro; Kellerer, Hans; Nicosia, Gaia; Pacifici, Andrea Parallel dedicated machines scheduling with chain precedence constraints. (English) Zbl 1253.90107 Eur. J. Oper. Res. 221, No. 2, 296-305 (2012). MSC: 90B35 90C60 PDF BibTeX XML Cite \textit{A. Agnetis} et al., Eur. J. Oper. Res. 221, No. 2, 296--305 (2012; Zbl 1253.90107) Full Text: DOI
Rasmussen, Matias Sevel; Justesen, Tor; Dohn, Anders; Larsen, Jesper The home care crew scheduling problem: preference-based visit clustering and temporal dependencies. (English) Zbl 1253.90154 Eur. J. Oper. Res. 219, No. 3, 598-610 (2012). MSC: 90B90 90B35 PDF BibTeX XML Cite \textit{M. S. Rasmussen} et al., Eur. J. Oper. Res. 219, No. 3, 598--610 (2012; Zbl 1253.90154) Full Text: DOI
Tamir, Tami Scheduling with bully selfish jobs. (English) Zbl 1253.68078 Theory Comput. Syst. 50, No. 1, 124-146 (2012). MSC: 68M20 90B35 68W25 PDF BibTeX XML Cite \textit{T. Tamir}, Theory Comput. Syst. 50, No. 1, 124--146 (2012; Zbl 1253.68078) Full Text: DOI
Dolgui, Alexandre; Gordon, Valery; Strusevich, Vitaly Single machine scheduling with precedence constraints and positionally dependent processing times. (English) Zbl 1251.90135 Comput. Oper. Res. 39, No. 6, 1218-1224 (2012). MSC: 90B35 68W25 PDF BibTeX XML Cite \textit{A. Dolgui} et al., Comput. Oper. Res. 39, No. 6, 1218--1224 (2012; Zbl 1251.90135) Full Text: DOI
Yuan, Junling; Li, Wenhua; Yuan, Jinjiang A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints. (English) Zbl 1252.68052 Theor. Comput. Sci. 457, 174-180 (2012). MSC: 68M20 68W27 90B35 PDF BibTeX XML Cite \textit{J. Yuan} et al., Theor. Comput. Sci. 457, 174--180 (2012; Zbl 1252.68052) Full Text: DOI
Kerivin, H. L. M.; Lacroix, M.; Mahjoub, A. R. On the complexity of the Eulerian closed walk with precedence path constraints problem. (English) Zbl 1280.68098 Theor. Comput. Sci. 439, 16-29 (2012). MSC: 68Q17 05C85 05C45 05C38 PDF BibTeX XML Cite \textit{H. L. M. Kerivin} et al., Theor. Comput. Sci. 439, 16--29 (2012; Zbl 1280.68098) Full Text: DOI
Oddi, Angelo; Rasconi, Riccardo; Cesta, Amedeo; Smith, Stephen F. Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis. (English) Zbl 1267.68217 Ann. Math. Artif. Intell. 62, No. 3-4, 371-402 (2011). Reviewer: Silvija Vlah Jerić (Zagreb) MSC: 68T20 68M20 68W20 PDF BibTeX XML Cite \textit{A. Oddi} et al., Ann. Math. Artif. Intell. 62, No. 3--4, 371--402 (2011; Zbl 1267.68217) Full Text: DOI
van Zuylen, Anke An improved monotone algorithm for scheduling related machines with precedence constraints. (English) Zbl 1235.90070 Oper. Res. Lett. 39, No. 6, 423-427 (2011). MSC: 90B35 90C59 90C60 PDF BibTeX XML Cite \textit{A. van Zuylen}, Oper. Res. Lett. 39, No. 6, 423--427 (2011; Zbl 1235.90070) Full Text: DOI
Dohn, Anders; Rasmussen, Matias Sevel; Larsen, Jesper The vehicle routing problem with time windows and temporal dependencies. (English) Zbl 1231.90085 Networks 58, No. 4, 273-289 (2011). MSC: 90B06 90B35 PDF BibTeX XML Cite \textit{A. Dohn} et al., Networks 58, No. 4, 273--289 (2011; Zbl 1231.90085) Full Text: DOI
Kim, Eun-Seok Scheduling of uniform parallel machines with s-precedence constraints. (English) Zbl 1225.90052 Math. Comput. Modelling 54, No. 1-2, 576-583 (2011). MSC: 90B35 PDF BibTeX XML Cite \textit{E.-S. Kim}, Math. Comput. Modelling 54, No. 1--2, 576--583 (2011; Zbl 1225.90052) Full Text: DOI
Gawiejnowicz, Stanisław; Lai, Tsung-Chyan; Chiang, Ming-Huang Scheduling linearly shortening jobs under precedence constraints. (English) Zbl 1217.90104 Appl. Math. Modelling 35, No. 4, 2005-2015 (2011). MSC: 90B35 90C35 PDF BibTeX XML Cite \textit{S. Gawiejnowicz} et al., Appl. Math. Modelling 35, No. 4, 2005--2015 (2011; Zbl 1217.90104) Full Text: DOI
Cao, Jianfa; Yuan, Jinjiang; Li, Wenjie; Bu, Hailin Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times. (English) Zbl 1207.90052 Int. J. Syst. Sci. 42, No. 1, 51-55 (2011). MSC: 90B35 68W27 PDF BibTeX XML Cite \textit{J. Cao} et al., Int. J. Syst. Sci. 42, No. 1, 51--55 (2011; Zbl 1207.90052) Full Text: DOI
Bodirsky, Manuel; Kára, Jan A fast algorithm and Datalog inexpressibility for temporal reasoning. (English) Zbl 1351.68051 ACM Trans. Comput. Log. 11, No. 3, Article No. 15, 21 p. (2010). MSC: 68N17 68Q25 68T20 68T27 PDF BibTeX XML Cite \textit{M. Bodirsky} and \textit{J. Kára}, ACM Trans. Comput. Log. 11, No. 3, Article No. 15, 21 p. (2010; Zbl 1351.68051) Full Text: DOI
Chentsov, A. G. Dynamic programming method in extremal constrained routing problems. (English. Russian original) Zbl 1272.49044 J. Comput. Syst. Sci. Int. 49, No. 3, 392-405 (2010); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2010, No. 3, 52-66 (2010). Reviewer: Vivek S. Borkar (Mumbai) MSC: 49L20 90C39 90B06 PDF BibTeX XML Cite \textit{A. G. Chentsov}, J. Comput. Syst. Sci. Int. 49, No. 3, 392--405 (2010; Zbl 1272.49044); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2010, No. 3, 52--66 (2010) Full Text: DOI
Hu, Xiaofeng; Bao, Jin-Song; Jin, Ye Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions. (English) Zbl 1197.90207 Int. J. Prod. Res. 48, No. 6, 1639-1651 (2010). MSC: 90B35 90C59 90B90 PDF BibTeX XML Cite \textit{X. Hu} et al., Int. J. Prod. Res. 48, No. 6, 1639--1651 (2010; Zbl 1197.90207) Full Text: DOI
Urlings, Thijs; Ruiz, Rubén; Stützle, Thomas Shifting representation search for hybrid flexible flowline problems. (English) Zbl 1206.90049 Eur. J. Oper. Res. 207, No. 2, 1086-1095 (2010). MSC: 90B35 PDF BibTeX XML Cite \textit{T. Urlings} et al., Eur. J. Oper. Res. 207, No. 2, 1086--1095 (2010; Zbl 1206.90049) Full Text: DOI
Gacias, Bernat; Artigues, Christian; Lopez, Pierre Parallel machine scheduling with precedence constraints and setup times. (English) Zbl 1231.90192 Comput. Oper. Res. 37, No. 12, 2141-2151 (2010). MSC: 90B35 90C57 PDF BibTeX XML Cite \textit{B. Gacias} et al., Comput. Oper. Res. 37, No. 12, 2141--2151 (2010; Zbl 1231.90192) Full Text: DOI
Hsu, Cheng-Hsien; Lin, Jiann-Fu A discussion on the performance of list scheduling jobs in a multiple machines environment. (English) Zbl 1200.68057 Adv. Comput. Sci. Eng. 4, No. 2, 173-184 (2010). MSC: 68M20 PDF BibTeX XML Cite \textit{C.-H. Hsu} and \textit{J.-F. Lin}, Adv. Comput. Sci. Eng. 4, No. 2, 173--184 (2010; Zbl 1200.68057) Full Text: Link
Jansen, Klaus; Solis-Oba, Roberto Approximation schemes for scheduling jobs with chain precedence constraints. (English) Zbl 1186.68067 Int. J. Found. Comput. Sci. 21, No. 1, 27-49 (2010). MSC: 68M20 68W25 68Q25 PDF BibTeX XML Cite \textit{K. Jansen} and \textit{R. Solis-Oba}, Int. J. Found. Comput. Sci. 21, No. 1, 27--49 (2010; Zbl 1186.68067) Full Text: DOI
Rothblum, Uriel G. Efficient solution of a stochastic scheduling problem on an out-forest – revisited. (English) Zbl 1198.90223 SIAM J. Optim. 20, No. 2, 903-914 (2009). Reviewer: Erwin Pesch (Siegen) MSC: 90B36 90C40 90C35 90C27 PDF BibTeX XML Cite \textit{U. G. Rothblum}, SIAM J. Optim. 20, No. 2, 903--914 (2009; Zbl 1198.90223) Full Text: DOI
Hanen, Claire; Zinder, Yakov The worst-case analysis of the Garey-Johnson algorithm. (English) Zbl 1185.90111 J. Sched. 12, No. 4, 389-400 (2009). MSC: 90B36 PDF BibTeX XML Cite \textit{C. Hanen} and \textit{Y. Zinder}, J. Sched. 12, No. 4, 389--400 (2009; Zbl 1185.90111) Full Text: DOI
Augustine, John; Banerjee, Sudarshan; Irani, Sandy Strip packing with precedence constraints and strip packing with release times. (English) Zbl 1171.68050 Theor. Comput. Sci. 410, No. 38-40, 3792-3803 (2009). MSC: 68W25 90C05 PDF BibTeX XML Cite \textit{J. Augustine} et al., Theor. Comput. Sci. 410, No. 38--40, 3792--3803 (2009; Zbl 1171.68050) Full Text: DOI
Felipe, A.; Ortuño, M. T.; Tirado, G. New neighborhood structures for the double traveling salesman problem with multiple stacks. (English) Zbl 1170.90464 Top 17, No. 1, 190-213 (2009). MSC: 90C27 PDF BibTeX XML Cite \textit{A. Felipe} et al., Top 17, No. 1, 190--213 (2009; Zbl 1170.90464) Full Text: DOI
Tavakkoli-Moghaddam, R.; Taheri, F.; Bazzazi, M.; Izadi, M.; Sassani, F. Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. (English) Zbl 1176.90247 Comput. Oper. Res. 36, No. 12, 3224-3230 (2009). MSC: 90B35 90C11 PDF BibTeX XML Cite \textit{R. Tavakkoli-Moghaddam} et al., Comput. Oper. Res. 36, No. 12, 3224--3230 (2009; Zbl 1176.90247) Full Text: DOI
Thielen, Clemens; Krumke, Sven O. A general scheme for designing monotone algorithms for scheduling problems with precedence constraints. (English) Zbl 1209.90187 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18–19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-93979-5/pbk). Lecture Notes in Computer Science 5426, 105-118 (2009). MSC: 90B35 68W25 91B26 PDF BibTeX XML Cite \textit{C. Thielen} and \textit{S. O. Krumke}, Lect. Notes Comput. Sci. 5426, 105--118 (2009; Zbl 1209.90187) Full Text: DOI
Kim, Eun-Seok; Sung, Chang-Sup; Lee, Ik-Sun Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints. (English) Zbl 1163.90006 Comput. Oper. Res. 36, No. 3, 698-710 (2009). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{E.-S. Kim} et al., Comput. Oper. Res. 36, No. 3, 698--710 (2009; Zbl 1163.90006) Full Text: DOI
Guschinskaya, Olga; Dolgui, Alexandre; Guschinsky, Nikolai; Levin, Genrikh Minimizing makespan for multi-spindle head machines with a mobile table. (English) Zbl 1163.90489 Comput. Oper. Res. 36, No. 2, 344-357 (2009). MSC: 90B35 PDF BibTeX XML Cite \textit{O. Guschinskaya} et al., Comput. Oper. Res. 36, No. 2, 344--357 (2009; Zbl 1163.90489) Full Text: DOI
Atamtürk, Alper; Zhang, Muhong The flow set with partial order. (English) Zbl 1218.90222 Math. Oper. Res. 33, No. 3, 730-746 (2008). MSC: 90C57 90C11 90C35 06A07 PDF BibTeX XML Cite \textit{A. Atamtürk} and \textit{M. Zhang}, Math. Oper. Res. 33, No. 3, 730--746 (2008; Zbl 1218.90222) Full Text: DOI
Yang, Aifeng; Yuan, Jinjiang A short note on the approximation of the single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints. (English) Zbl 1183.90202 J. Zhejiang Univ., Sci. Ed. 35, No. 6, 618-620 (2008). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{A. Yang} and \textit{J. Yuan}, J. Zhejiang Univ., Sci. Ed. 35, No. 6, 618--620 (2008; Zbl 1183.90202) Full Text: DOI
Zuo, Lan Scheduling unit length jobs on uniform machines subject to chain-like precedence constraint. (Chinese. English summary) Zbl 1183.90212 J. Shaoxing Univ., Nat. Sci. 28, No. 8, 11-14 (2008). MSC: 90B35 90C27 PDF BibTeX XML Cite \textit{L. Zuo}, J. Shaoxing Univ., Nat. Sci. 28, No. 8, 11--14 (2008; Zbl 1183.90212)
Gordon, V. S.; Potts, C. N.; Strusevich, V. A.; Whitehead, J. D. Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation. (English) Zbl 1168.90441 J. Sched. 11, No. 5, 357-370 (2008). MSC: 90B35 PDF BibTeX XML Cite \textit{V. S. Gordon} et al., J. Sched. 11, No. 5, 357--370 (2008; Zbl 1168.90441) Full Text: DOI
Ruiz, Rubén; Şerifoğlu, Funda Sivrikaya; Urlings, Thijs Modeling realistic hybrid flexible flowshop scheduling problems. (English) Zbl 1180.90135 Comput. Oper. Res. 35, No. 4, 1151-1175 (2008). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{R. Ruiz} et al., Comput. Oper. Res. 35, No. 4, 1151--1175 (2008; Zbl 1180.90135) Full Text: DOI
Krumke, Sven O.; Schwahn, Anne; van Stee, Rob; Westphal, Stephan A monotone approximation algorithm for scheduling with precedence constraints. (English) Zbl 1144.90384 Oper. Res. Lett. 36, No. 2, 247-249 (2008). MSC: 90B35 PDF BibTeX XML Cite \textit{S. O. Krumke} et al., Oper. Res. Lett. 36, No. 2, 247--249 (2008; Zbl 1144.90384) Full Text: DOI