Aerts, Korst and Verhaegh. Multiprocessor scheduling with machine eligibility:
time complexity results.
Agnetis, Hall and Pacciarelli. Sequence coordination in supply chains.
Alfieri, Nicosia and Agnetis. Part batching and scheduling in a flexible
cell to minimize setup costs.
Aloulou, Kovalyov and Portmann. Single machine scheduling to maximize maximum
cost. Single machine scheduling to maximize maximum cost
Ammerlaan and van de Velde. Prodcution planning and scheduling of a foundry.
Anderson and Potts. On-line scheduling of a single machine to minimize
total weighted completion time.
Angel and Bampis. A multi-start Dynasearch algorithm for the time dependant
single machine total weighted tardiness scheduling problem.
Angelelli, Speranza and Tuza. Semi on-line scheduling problems on two parallel
processors with bounds on the tasks.
Artigues, Demassey and Michelon. A new LP based lower bound for the RCPSP.
Babu, Peridy and Pinson. Single machine total weighted tardiness scheduling
Bachman and Janiak. Complexity results for some scheduling problems with
time-dependent processing times to minimize the total weighted completion
Baldacci and Dell'Amico. Optimization of a large scale planning and scheduling problem
in a business-to-buisness context.
Bampis, Giroudeau and Kononov. Scheduling tasks with small hierarchical
Baptiste. Preemptive scheduling of Identical machines.
Blazewicz, Finke and Pawlak. Circular-Arc Graph model for FMS.
Blazewicz, Pesch and Sterna. Tabu search approach for FMS scheduling.
Brasel and Dhamala. On groups in the set of sequences.
Brauner, Crama, Grigoriev and van de Klundert. On the complexity of high
multiplicity scheduling problems.
Brucker, Heitmann and Hurink. Flow-Shop Problems with intermedfiate buffers.
Caramia, Dell'Olmo and Iovanella. New lower bound algorithms for multiprocessor
task scheduling with ready times.
Cheng, Kovalyov and Shakhlevich. Scheduling with controllable release dates
and processing times.
Chrobak, Csirik, Imreh, Noga, Sgall and Woeginger. The buffer minimization
problem for scheduling with conflicts.
Chu and Gordon. Scheduling with due date determination under TWK model:
NP-Hardness and polynomially solvable case.
De Bontridder. A purchase lot sizing problem with quantity discount.
Della'Croce and T'kindt. A recoveriung Beam search algorithm for the one
machine dynamic total completion time scheduling problem.
Den Boef, Verhaegh and Korst. Smoothing streams in an in-home digital network.
Dolgui and Sotskova. Stability analysis for assembly lines sequencing with
uncertain processing times.
Drobouchevitch, Sethi, Sidney and Sriskandarajah. Scheduling multiple parts
in two-machines dual-gripper robot cells: heuristic algorithms and performance
Drozdowski and Wolniewicz. Scheduling divisible loads in systems with limited
Erlebach and Spieksma. On a weighted interval selection problem: applications,
algortihms and approximation.
Franca, Junior and Buriol. The non-wait flowshop problem with sequence
dependent setup times and release dates.
Gawiejnowicz, Kononov and Lai. Scheduling time-dependant tasks subject
to precedence constraints.
Gawiejnowicz, Kurc and Pankowska. Polynomial time solution of a bicriterion
single machine time dependent scheduling problem.
Gimadi, Zalyubovsky and Sevastianov. On polynomial solvability of the Resource
Constrained Project Scheduling problem under stored resources.
Hanen, Munier, Singh and Zinder. Priority algorithms for scheduling on
parallel processors with precedence constraints.
Hou and Hoogeven. The three machine proportionate flowshop problem with
unequal machine speeds.
Hurink and Knust. List scheduling in a parallel machine environment with
precedence constraints and setup times.
Janiak, Kovalyov and Portmann. Single machine group scheduling with resource
dependent setup and processing times.
Jeunehomme, Legait, Baptiste. Hoist Scheduling Problem: A real time approach
based on taboo search.
Jouglet, Baptiste and Carlier. Minimizing total tardiness on one machine
with release dates.
Jozefowska, Mika, Rozycki, Waligora and Weglarz. An almost optimal heuristic
for preemptive Cmax scheduling of dependant jobs on identical parallel
Kellerer and Strusevich. Scheduling problems for parallel dedicated machines
under resource constraints.
Kis. Solving the job-insertion problem by branch-and-bound.
Kubiak. Scheduling half-products.
Lazarev and Kvaratskhelia. Experimental Research of Measure of Decidability for Minimizing Total Tardiness on a Single Machine.
Lichtenstein, Oguz, Do and Zinder. Deterministic scheduling problems with multiprocessor
tasks: NP-hardness results, polynomilally sovable cases and approximation
Lorigeon, Bouquard and Billaut. Two machines openshop scheduling problems
with availability constraint.
Marte. Tracks and Symmetry Exclusion in School Timetabling.
Mascis and Pacciarelli. Train scheduling on rail networks at the operational
Mastrolilli. Core instances for Constrained Scheduling problems.
Mattfeld and Branke. A modification to performance criteria for non-deterministic
Michiels and Korst. Performance ratios for the grouped best fit algorithm.
Nazarathy and Weiss. Fluid Heuristics for Job Shop Scheduling.
Oguz, Hou. A heuristic algorithm for scheduling multiprocessor tasks with
Prianichnikova. Off-line scheduling for a communication system in air traffic
Pruhs. Minimizing weighted flow time with preemption.
Salido and Barber. Preprocessing algorithms for non-binary disjunctive
constraints in scheduling problems; Application to non-linear constraints
Schuurman and Vredeveld. Performance guarantees of loca search for multiprocessor
Servakh. A dynamic programming algorithm for scheduling under resource
Sevastianov and Tchernykh. 4-Parameter complexity analysis of the open-shop
Siraev. An experimental study of approximation algorithms to minimize total
weighted completion time with precedence constraints.
Sitters. On the complexity of scheduling unrelated parallel machines.
Sotskov and Allahverdi. Two-machine flowshop scheduling with bounded processing
Soukhal and Martineau. Mathematical programming model for flowshop robotic
Szwarc, Grosso and Della Croce. Algorithmic paradoxes of the single machine
total tardiness problem.
Willenius. How to solve a scheduling problem with uncertain numerical data.