publications

Journal Publications

To appear:

Lambers, R., R. Pendavingh, and F.C.R. Spieksma, How to design a serial knockout competition, accepted by Mathematics of Operations Research.

2024:

de Ferrante, H.C., M. van Rosmalen, B.M.L. Smeulders, S. Vogelaar, F.C.R. Spieksma, Revising Model for End-stage Liver Disease from calendar-time cross-sections with correction for selection bias, BMC Medical Research Methodology 24, 51. (pdf)

de Berg, M., A. Sadhukhan, and F.C.R. Spieksma, Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem, SIAM Journal of Discrete Mathematics 38, 790-827. (pdf)

Smeulders, B., D. Blom, and F.C.R. Spieksma, Identifying optimal strategies in kidney exchange games is Σ₂^p-complete, Mathematical Programming 203, 347-368. (pdf)

Blom, D., B. Smeulders, and F.C.R. Spieksma, Rejection-Proof Mechanisms for Multi-Agent Kidney Exchange, Games and Economic Behavior 143, 25-50. (pdf)

2023:

de Ferrante, H.C., B. Smeulders, I. Tieken, S. Heidt, G.W. Haasnoot, F.H.J. Claas, S. Vogelaar, F.C.R. Spieksma, Immunized patients face reduced access to transplantation in the Eurotransplant Kidney Allocation System, Transplantation 107, 2247-2254. (pdf)

Lambers, R., D. Goossens, and F.C.R. Spieksma, The Flexibility of Home Away Pattern Sets, Journal of Scheduling 26, 413-423. (pdf)

Lambers, R., J. Briët, V. Patel, F.C.R. Spieksma, M.A. Yildiz, Orthogonal Schedules in Single Round Robin Tournaments, Operations Research Letters 51, 528-532. (pdf)

Lambers, R., L. Rothuizen, and F.C.R. Spieksma, How to schedule the Volleyball Nations League, Journal of Sports Analytics 9, 157-169. (pdf)

van Doornmalen, J., C. Hojny, R. Lambers, and F.C.R. Spieksma, Integer programming models for round robin tournaments, European Journal of Operational Research 310, 24-33. (pdf)

2022:

Blom, D., R. Pendavingh, and F.C.R. Spieksma, Filling a theatre in times of the COVID-19 pandemic, INFORMS Journal on Applied Analytics 52, 473-484. (pdf)

Smeulders, B., V. Bartier, Y. Crama, and F.C.R. Spieksma, Recourse in Kidney Exchange Programs, INFORMS Journal on Computing 34, 1191-1205. (pdf) (online supplement)

Morin, P.-A., C. Artigues, A. Haït, T. Kis, F.C.R. Spieksma, A project scheduling problem with periodically aggregated resource-constraints, Computers and Operations Research 141, article number 105688. (pdf)

Luo, K. and F.C.R. Spieksma, Minimizing travel time and latency in car-sharing problems, Algorithms 15, article number 30. (pdf)

Vangerven, B., D. Briskorn, D. Goossens, and F.C.R. Spieksma, Parliament Seating Assignment Problems, European Journal of Operational Research 296, 914-926. (pdf)

2021:

Lambers, R. and F.C.R. Spieksma, A mathematical analysis of fairness in shootouts, IMA Journal of Management Mathematics 32, 411-424. (pdf)

Ophelders, T., R. Lambers, F.C.R. Spieksma, and T. Vredeveld, A Note on Equitable Hamiltonian Cycles, Discrete Applied Mathematics 303, 127-136. (pdf)

Berghman, L., F.C.R. Spieksma, and V. T’Kindt, Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes, RAIRO-Operations Research 55, S1747-S1765. (pdf)

Vangerven, B., D. Goossens, and F.C.R. Spieksma, Using feedback to mitigate coordination and threshold problems in iterative combinatorial auctions, Business & Information Systems Engineering 63, 113-127. (pdf)

Biró, P., J. van de Klundert, D. Manlove, W. Petterson, T. Andersson, L. Burnapp, P. Chromy, P. Delgado, P. Dworczak, B. Haase, A. Hemke, R. Johnson, X. Klimentova, D. Kuypers, A. Nanni Costa, B. Smeulders, F. Spieksma, M. Valentín, A. Viana, Modelling and optimisation in European Kidney Exchange Programmes, European Journal of Operational Research 291, 447-456. (pdf)

Ficker, A.M.C., F.C.R. Spieksma, and G.J. Woeginger, The transportation problem with conflicts, Annals of Operations Research 298, 207-227. (pdf)

2020:

Davari, M., D. Goossens, J. Beliën, R. Lambers, and F.C.R. Spieksma, The multi-league sports scheduling problem, or how to schedule thousands of matches, Operations Research Letters 48, 180-187. (pdf) .

2019:

Passchyn, W., D. Briskorn, and F.C.R. Spieksma, No-wait scheduling for locks, INFORMS Journal on Computing 31, 413-428. (pdf)

Biró, P., B. Haase-Kromwijk, T. Andersson, E. I. Ásgeirsson, T. Baltesová, I. Boletis, C. Bolotinha, G. Bond, G. Böhmig, L. Burnapp, K. Cechlárová, P. Di Ciaccio, J. Fronek, K. Hadaya, A. Hemke, C. Jacquelinet, R. Johnson, R. Kieszek, D. Kuypers, R. Leishman, M.-A. Macher, D. Manlove, G. Menoudakou, M. Salonen, B. Smeulders, V. Sparacino, F. Spieksma, M. de la Oliva Valentín Muñoz, N. Wilson, J. van de Klundert, Building kidney exchange programmes in Europe – An overview of exchange practice and activities, Transplantation 103, 1514-1522. (pdf)

Pinson, N. and F.C.R. Spieksma, Online Interval Scheduling on Two Related Machines: the Power of Lookahead, Journal of Combinatorial Optimization 38, 224-253. (pdf)

Passchyn, W. and F.C.R. Spieksma, Scheduling parallel batching machines in a sequence, Journal of Scheduling 22, 335-357. (pdf)

Van Bulck, D., D. Goossens, and F.C.R. Spieksma, Scheduling a Non-Commercial Indoor Football League: a Tabu Search Based Approach, Annals of Operations Research 275, 715-730. (pdf)

Toffolo, T., J. Christiaens, F.C.R. Spieksma, and G. Vanden Berghe, The sport teams grouping problem, Annals of Operations Research 275, 223-243. (pdf)

Smeulders, B., Y. Crama, and F.C.R. Spieksma, Revealed preference theory: an algorithmic outlook, European Journal of Operational Research 272, 803-815. (pdf)

2018:

Lambrechts, E., A. Ficker, D. Goossens, and F.C.R. Spieksma, Round-robin tournaments generated by the Circle Method have maximum carry-over, Mathematical Programming 172, 277-302. (pdf)

Ficker, A.M.C., G.J. Woeginger, and F.C.R. Spieksma, Robust balanced optimization, EURO Journal on Computational Optimization 6, 239-266. (pdf)

Vangerven, B., A. Ficker, D. Goossens, W. Passchyn, F.C.R. Spieksma, and G. Woeginger, Conference scheduling – A personalized approach, OMEGA 81, 38-47. (pdf)

Smeulders, B., C. Davis-Stober, M. Regenwetter, and F.C.R. Spieksma, Testing Probabilistic Models of Choice using Column Generation, Computers and Operations Research 95, 32-43. (pdf)

2017:

Kinable, J., B. Smeulders, E. Delcour, and F.C.R. Spieksma, Exact algorithms for the Equitable Traveling Salesman Problem, European Journal of Operational Research 261, 475-485. (pdf)

Dokka, T., I. Mourtos, and F.C.R. Spieksma, Fast separation for the three-index assignment problem, Mathematical Programming Computation 9, 39-59. (pdf)

Vangerven, B., D. Goossens, and F.C.R. Spieksma, Winner Determination in Geometrical Combinatorial Auctions, European Journal of Operational Research 258, 254-263. (pdf)

2016:

Talla Nobibon, F., L. Cherchye, Y. Crama, T. Demuynck, B. De Rock, and F.C.R. Spieksma, Revealed preference tests of collectively rational consumption behavior: formulations and algorithms, Operations Research 64, 1197-1216. (pdf)

Passchyn, W., D. Briskorn, S. Coene, J. Hurink, F.C.R. Spieksma, and G. Vanden Berghe, The lockmaster’s problem, European Journal of Operational Research 251, 432-441. (pdf)

Dokka, T. and F.C.R. Spieksma, Facets of the axial three-index assignment polytope, Discrete Applied Mathematics 201, 86-104. (pdf)

Goossens, D., S. Polyakovskiy, F.C.R. Spieksma, and G.J. Woeginger, The focus of attention problem, Algorithmica 74, 559-573. (pdf)

Passchyn, W., D. Briskorn, and F.C.R. Spieksma, Mathematical programming models for lock scheduling with an emission objective, European Journal of Operational Research 248, 802-814. (pdf)

2015:

Goossens, D., J. Kempeneers, R.H. Koning, and F.C.R. Spieksma, Winning in straight sets helps in Grand Slam tennis, the International Journal of Performance Analysis in Sports 15, 1007-1021. (pdf)

Smeulders, B., L. Cherchye, B. De Rock, F.C.R. Spieksma, and F. Talla Nobibon, Transitive preferences in multi-member households, Economic Theory Bulletin 3, 243-254. (pdf)

Talla Nobibon, F., B. Smeulders, and F.C.R. Spieksma, A Note on Testing Axioms of Revealed Preference, Journal of Optimization Theory and Applications 166, 1063-1070. (pdf)

Smeulders, B., L. Cherchye, B. De Rock, F.C.R. Spieksma, and F. Talla Nobibon, Complexity results for the Weak Axiom of Revealed Preference for collective consumption models, Journal of Mathematical Economics 58, 82-91. (pdf)

Berghman, L. and F.C.R. Spieksma, Valid inequalities for a time-indexed formulation, Operations Research Letters 43, 268-272. (pdf)

2014:

Dokka, T., Y. Crama, and F.C.R. Spieksma, Multi-Dimensional Vector Assignment Problems, Discrete Optimization 14, 111-125. (pdf)

Goossens, D., S. Onderstal, J. Pijnacker, and F.C.R. Spieksma, Solids: a combinatorial auction for real estate, Interfaces 44, 351-363. (pdf)

Kinable, J., F.C.R. Spieksma, and G. Vanden Berghe, Schoolbus Routing - a column generation approach, International Transactions on Operations Research 21, 453-478. (pdf)

Vancroonenburg, W., F. Della Croce, D. Goossens, and F.C.R. Spieksma, The red-blue transportation problem, European Journal of Operational Research 237, 814-823. (pdf)

Verstichel, J., P. De Causmaecker, F.C.R. Spieksma, and G. Vanden Berghe, The generalized lock scheduling problem: an exact approach, Transportation Research part E 65, 16-34. (pdf)

Smeulders, B., L. Cherchye, B. De Rock, and F.C.R. Spieksma, Goodness of fit measures for revealed preference tests: Complexity results and algorithms, ACM Transactions on Economics and Computation 2, 3:1 - 3:16. (pdf)

Verstichel, J., P. De Causmaecker, F.C.R. Spieksma, and G. Vanden Berghe, Exact and heuristic methods for placing ships in locks, European Journal of Operational Research 235, 387-398. (pdf)

Berghman, L., Leus, R., and F.C.R. Spieksma, Optimal solutions for a dock assignment problem with trailer transportation, Annals of Operations Research 213, 3-25. (pdf)

2013:

Smeulders, B., L. Cherchye, B. De Rock, and F.C.R. Spieksma, The Money Pump as a Measure of Revealed Preference Violations: A Comment, Journal of Political Economy 121, 1248-1258. (pdf).

Schittekat, P., J. Kinable, K. Sörensen, M. Sevaux, F.C.R. Spieksma, and J. Springael, A metaheuristic for the school bus routing problem with bus stop selection, European Journal of Operational Research 229, 518-528. (pdf)

Polyakovskiy, S., F.C.R. Spieksma, and G.J. Woeginger, The three-dimensional matching problem in Kalmanson matrices, Journal of Combinatorial Optimization 26, 1-9. (pdf)

Coene, S., C. Filippi, F.C.R. Spieksma, and E. Stevanato, Balancing profits and costs on trees, Networks 61, 200-211. (pdf)

Dewilde, T., D. Cattrysse, S. Coene, F.C.R. Spieksma, and P. Vansteenwegen, Heuristics for the traveling repairman problem with profits, Computers and Operations Research 70, 1700-1707. (pdf)

Maya Duque, P.A., S. Coene, P. Goos, K. Sörensen, and F.C.R. Spieksma, The accessibility arc upgrading problem, European Journal of Operational Research 224, 458-465. (pdf).

2012:

Goossens, D., S. Polyakovskiy, F.C.R. Spieksma, and G.J. Woeginger, Between a rock and a hard place: The two-to-one assignment problem, Mathematical Methods of Operations Research 76, 223-237. (pdf)

Talla Nobibon, F., C. Hurkens, R. Leus, and F.C.R. Spieksma, Coloring graphs using two colors while avoiding monochromatic cycles, INFORMS Journal on Computing 24, 485-499. (pdf)

Goossens, D. and F.C.R. Spieksma, Soccer schedules in Europe: an overview, Journal of Scheduling 15, 641-651. (pdf)

Coene, S., A. Dutta, F.C.R. Spieksma, and P. Tsiotras, On the computational complexity of peer-to-peer satellite refueling strategies, INFOR 50, 88-94. (pdf)

Dokka, T., A. Kouvela, and F.C.R. Spieksma, Approximating the Multi-Level Bottleneck Assignment Problem, Operations Research Letters 40, 282-286. (pdf)

Goossens, D. and F.C.R. Spieksma, The carry-over effect does not influence football results, Journal of Sports Economics 13, 288-305. (pdf)

Dürr, C., M. Queyranne, F.C.R. Spieksma, F. Talla Nobibon, and G.J. Woeginger, The interval ordering problem, Discrete Applied Mathematics 160, 1094-1103. (pdf)

Goossens, D., J. Beliën, and F.C.R. Spieksma, Comparing league formats with respect to match importance in Belgian football, Annals of Operations Research 194, 223-240. (pdf)

Michiels, W., E. Aarts, J. Korst, J. van Leeuwen, and F.C.R. Spieksma, Computer-assisted proof of performance ratios for the Differencing Method, Discrete Optimization 9, 1-16. (pdf)

2011:

Goossens, D. and F.C.R. Spieksma, Breaks, cuts, and patterns, Operations Research Letters 39, 428-432. (pdf)

Coene, S., F.C.R. Spieksma, and G.J. Woeginger, Charlemagne's challenge: the periodic latency problem, Operations Research 59, 674-683. (pdf)

Talla Nobibon, F., L. Cherchye, B. De Rock, J. Sabbe, and F.C.R. Spieksma, Heuristics for deciding collectively rational consumption behavior, Computational Economics 38, 173-204. (pdf)

Talla Nobibon, F., R. Leus, and F.C.R. Spieksma, Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms, European Journal of Operational Research 210, 670-683. (pdf)

2010:

Briskorn, D., A. Drexl, and F.C.R. Spieksma, Round robin tournaments and three index assignments, 4OR 8, 365-374.(pdf)

Coene, S., A. Arnout, and F.C.R. Spieksma, On a periodic vehicle routing problem, Journal of the Operational Research Society 61, 1719-1728. (pdf)
(This paper contains computational experiments on instances that can be found here: high-risk waste instance.xls, high-risk waste instance_travel times.txt, low-risk waste instance.xls)

Talla Nobibon, F. and F.C.R. Spieksma, On the complexity of testing the Collective Axiom of Revealed Preference, Mathematical Social Sciences 20, 123-136. (pdf)

Goossens, D.R., R. Müller, and F.C.R. Spieksma, Algorithms for recognizing economic properties in matrix bid combinatorial auctions, INFORMS Journal on Computing 22, 339-352. (pdf)

Goossens, D., S. Polyakovskiy, F.C.R. Spieksma, and G.J. Woeginger, The approximability of three-dimensional assignment problems with bottleneck objective, Optimization Letters 4, 7-16. (pdf)

2009:

Erlebach, T., L. Moonen, F.C.R. Spieksma, and D. Vukadinovic, Connectivity Measures for Internet Topologies on the Level of Autonomous Systems, Operations Research 57, 1006-1025. (pdf)

Goossens, D. and F.C.R. Spieksma, Scheduling the Belgian soccer league, Interfaces 39, 109-118. (pdf)

Goossens, D. and F.C.R. Spieksma, The transportation problem with exclusionary side constraints, 4OR 7, 51-60. (pdf)

Goossens, D. and F.C.R. Spieksma, Exact algorithms for the matrix bid auction, Computers and Operations Research 36, 1090-1109. (pdf)

2008:

Adem, J., Y. Crama, W. Gochet, and F.C.R. Spieksma, Counting and enumerating aggregate classifiers, Discrete Applied Mathematics 156, 2459-2468. (pdf)

Coene, S. and F.C.R. Spieksma, Profit-based latency problems on the line, Operations Research Letters 36, 333-337. (pdf)

Coene, S., N. Hop, J. van de Klundert, and F.C.R. Spieksma, A note on a motion control problem for a placement machine, Operations Research Spectrum 30, 535-549. (pdf)

Moonen, L.S. and F.C.R. Spieksma, Partitioning a weighted partial order, Journal of Combinatorial Optimization 15, 342-356. (pdf)

2007:

Kolen, A.W.J, C.H. Papadimitriou, J.K. Lenstra, and F.C.R. Spieksma, Interval Scheduling: A Survey, Naval Research Logistics 54, 530-543. (pdf)

Bouhtou, M., A. Grigoriev, S. van Hoesel, A.F. van der Kraaij, F.C.R. Spieksma, and M. Uetz, Pricing bridges to cross a river, Naval Research Logistics 54, 411-420. (pdf)

Oosten, M., J.H.G.C. Rutten, and F.C.R. Spieksma, Disconnecting graphs by removing vertices: a polyhedral approach, Statistica Neerlandica 61, 35-60. (pdf)

Crama, Y., L.S. Moonen, F.C.R. Spieksma, and E. Talloen, The tool switching problem revisited, European Journal of Operational Research 182, 952-957.(pdf)

Goossens, D.R., A.J.T. Maas, F.C.R. Spieksma, and J.J. van de Klundert, Exact algorithms for procurement problems under a total quantity discount structure, European Journal of Operational Research 178, 603-626. (pdf)

2006:

Kovaleva, S. and F.C.R. Spieksma, Approximation algorithms for rectangle stabbing and interval stabbing problems, SIAM Journal on Discrete Mathematics 20, 748-768. (pdf)

Moonen, L.S. and F.C.R. Spieksma, Exact algorithms for a loading problem with bounded clique width, INFORMS Journal on Computing 18, 455-465. (pdf)

Grigoriev, A., J.J. van de Klundert, and F.C.R. Spieksma, Modeling and solving the periodic maintenance problem, European Journal of Operational Research 172, 783-797. (pdf)

2005:

Spieksma, F.C.R. and G.J. Woeginger, The no-wait flow-shop paradox, Operations Research Letters 33, 603-608. (pdf)

Klundert, J. van de, J. Kuipers, F.C.R. Spieksma, and M. Winkels, Selecting telecommunication carriers to obtain volume discounts, Interfaces 35, 124-132. (pdf)

2004:

Bandelt, H.-J., A. Maas, and F.C.R. Spieksma, Local search heuristics for multi-index assignment problems, Journal of the Operational Research Society 55, 694-704. (pdf)

2003:

Spieksma, F.C.R., Over versnijden, volgorde’s, en veilingen: combinatorisch optimaliseren in de praktijk, Tijdschrift voor Economie en Management 48, 97-118. (pdf)

Storms, P.P.A. and F.C.R. Spieksma, An LP-based algorithm for the data association problem in multi-target tracking, Computers and Operations Research 30, 1067-1085. (pdf)

Aerts, J., J. Korst, F. Spieksma, W. Verhaegh, and G. Woeginger, Random redundant storage in disk arrays: complexity of retrieval problems, IEEE Transactions on Computers 52, 1210-1214. (pdf)

Erlebach, T. and F.C.R. Spieksma, Interval selection: applications, algorithms and lower bounds, Journal of Algorithms 46, 27-53. (pdf)

2002:

Faneyte, D.B.C., F.C.R. Spieksma, and G.J. Woeginger, A branch-and-price algorithm for a hierarchical crew scheduling problem, Naval Research Logistics 49, 743-759. (pdf)

Crama, Y., J.J. van de Klundert, and F.C.R. Spieksma, Production planning problems in printed circuit board assembly, Discrete Applied Mathematics 123, 339-361. (pdf)

Kovaleva, S. and F.C.R. Spieksma, Primal-dual approximation algorithms for a packing-covering pair of problems, RAIRO-Récherche Opérationelle 36, 53-72. (pdf)

2001:

Oosten, M., J.H.G.C. Rutten, and F.C.R. Spieksma, The clique partitioning problem: facets and patching facets, Networks 38, 209-226. (pdf)

McCormick, S.T., S.R. Smallwood, and F.C.R. Spieksma, A polynomial algorithm for multiprocessor scheduling with two job lenghts, Mathematics of Operations Research 26, 31-49. (pdf)

2000:

Kolen, A.W.J. and F.C.R. Spieksma, Solving a bi-criterion cutting stock problem with open-ended demand: a case study, Journal of the Operational Research Society 51, 1238-1247.(pdf)

Klomp, C., J.J. van de Klundert, F.C.R. Spieksma, and S. Voogt, The feeder rack assignment problem in PCB assembly: a case study, International Journal of Production Economics 64, 399-407. (pdf)

1999:

Bandelt, H.-J., M. Oosten, J.H.G.C. Rutten, and F.C.R. Spieksma, Lifting theorems and facet characterization for a class of clique partitioning inequalities, Operations Research Letters 24, 235-243. (pdf)

Spieksma, F.C.R., On the approximability of an interval scheduling problem, Journal of Scheduling 2 , 215-227. (pdf)

1998:

Queyranne, M., F.C.R. Spieksma, and F. Tardella, A general class of greedily solvable linear programs, Mathematics of Operations Research 23, 892-908. (pdf)

1997:

Crama, Y., O.E. Flippo, J.J. van de Klundert, and F.C.R. Spieksma, The assembly of printed circuit boards: a case with multiple machines and multiple board types, European Journal of Operational Research 98, 457-472. (pdf)

Queyranne, M. and F.C.R. Spieksma, Approximation algorithms for multi-index transportation problems with decomposable costs, Discrete Applied Mathematics 76, 239-254. (pdf)

1996:

Crama, Y., O.E. Flippo, J.J. van de Klundert, and F.C.R. Spieksma, The component retrieval problem in printed circuit board assembly, The International Journal of Flexible Manufacturing Systems 8, 287-312. (pdf)

Spieksma, F.C.R. and G.J. Woeginger, Geometric three-dimensional assignment problems, European Journal of Operational Research 91, 611-618. (pdf)

Derks, J.J.M. and F.C.R. Spieksma, A decision support system for locating facilities and routing traffic on a factory site, Belgian Journal of Operations Research, Statistics, and Computer Science 36, 173-184. (pdf)

Crama, Y. and F.C.R. Spieksma, Scheduling jobs of equal length: complexity, facets and computational results, Mathematical Programming 72, 207-227. (pdf)

1995:

Spieksma, F.C.R., G.J. Woeginger, and Z. Yu, Scheduling with safety distances, Annals of Operations Research (Mathematics of Industrial Systems) 57, 251-264. (pdf)

1994:

Spieksma, F.C.R. and G.J. Woeginger, The computational complexity of a bin packing game, Central European Journal for Operations Research and Economics 3, 39-49. (pdf)

Bandelt, H.-J., Y. Crama, and F.C.R. Spieksma, Approximation algorithms for multidimensional assignment problems with decomposable costs, Discrete Applied Mathematics 49, 25-50. (pdf)

Spieksma, F.C.R., A branch-and-bound algorithm for the two-dimensional vector packing problem, Computers and Operations Research 21, 19-25. (pdf)

Crama, Y., A.W.J. Kolen, A.G. Oerlemans, and F.C.R. Spieksma, Minimizing the number of tool switches on a flexible machine, The International Journal of Flexible Manufacturing Systems 6, 33-54. (pdf)
(This paper contains computational experiments on instances that can be found here: instancesIJFMS.htm)

1992:

Crama, Y. and F.C.R. Spieksma, Approximation algorithms for three-dimensional assignment problems with triangle inequalities, European Journal of Operational Research 60, 273-279. (pdf)
(This paper contains computational experiments on instances that can be found here: instancesEJOR.htm)

1990:

Spieksma, F.C.R., K. Vrieze, and A.G. Oerlemans, On the system setup and the scheduling problem in a flexible manufacturing system (FMS), Statistica Neerlandica 44, 125-138. (pdf)

Crama, Y., A.W.J. Kolen, A.G. Oerlemans, and F.C.R. Spieksma, Throughput rate optimization in the automated assembly of printed circuit boards, Annals of Operations Research 26, 455-480. (pdf)