Optimal scheduling of the -machine assembly-type flow shop
Optimal scheduling of the 3-machine assembly-type flow shop
We address the 3-Machine Assembly-Type Flowshop Scheduling Problem (3MAF). This problem is known to be NP-complete in the strong sense. We propose an exact branch and bound method based on a recursive enumeration of potential inputs and outputs of the machines. Using this algorithm, several large size instances have been solved to optimality.
Optimal starting times for a class of single machine scheduling problems with earliness and tardiness penalties
Optimization Algorithms for a Class of Single Machine Scheduling Problems Using Due Date determination Methods
Optimum ordering policies with lead time for an operating unit
Optimum workforce scheduling under the (14, 21) days-off timetable.
Ordonnancement de tâches sur un système multiprocesseur - modèles déterministes et modèles stochastiques
Ordonnancements à contraintes disjonctives
Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
Original title unknown
Original title unknown
Original title unknown