Combinatorial optimization issues in scheduling

The special issue of the Journal of Scheduling is devoted to the ECCO XXI Conference, the 21st Annual Meeting of the European Chapter on Combinatorial Optimization, which was held at the facilities of the University of Dubrovnik (Croatia) from May 29 to May 31, 2008. The scientific program consisted of three parallel streams and 21 sessions in seven time slots. The topics included Scheduling, Networks, Graphs, Linear and Integer Programming, Layout and Location, Metaheuristics, Routing, Nonlinear Programming, Game Theory, and Planning. Kacem and Kellerer describe the design of efficient approximation algorithms for the single-machine weighted flow-time minimization problem when jobs have release dates and weights equal to their processing times under the assumption that one job is fixed. Mika,Waligora, and Weglarz consider a problem of allocating resources of a grid to workflow applications. Matsumoto, Umetani, and Nagamochi consider the one-dimensional cutting stock problem (1D-CSP).