Narrow search
Showing 1 - 6 of 6
Cover Image
New exact algorithms for one-machine earliness-tardiness scheduling
Sourd, Francis - In: INFORMS journal on computing : JOC 21 (2009) 1, pp. 167-175
Persistent link: https://www.econbiz.de/10003896696
Cover Image
New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
Sourd, Francis - In: INFORMS journal on computing : JOC 21 (2009) 1, pp. 167
Persistent link: https://www.econbiz.de/10008213931
Cover Image
A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
Sourd, Francis; Spanjaard, Olivier - In: INFORMS journal on computing : JOC 20 (2008) 3, pp. 472-484
Persistent link: https://www.econbiz.de/10008076019
Cover Image
Multiple-Machine Lower Bounds for Shop-Scheduling Problems
Sourd, Francis; Nuijten, Wim - In: INFORMS journal on computing : JOC 12 (2000) 4, pp. 341-352
Persistent link: https://www.econbiz.de/10007115882
Cover Image
The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions
Sourd, Francis - In: INFORMS journal on computing : JOC 16 (2004) 2, pp. 198
Persistent link: https://www.econbiz.de/10007101469
Cover Image
A multiobjective branch-and-bound framework : application to the biobjective spanning tree problem
Sourd, Francis; Spanjaard, Olivier - In: INFORMS journal on computing : JOC 20 (2008) 3, pp. 472-484
Persistent link: https://www.econbiz.de/10003770222