scientific article; zbMATH DE number 1082109
From MaRDI portal
Publication:4365136
zbMath0912.90170MaRDI QIDQ4365136
Chris N. Potts, Edward J. Anderson, Celia A. Dr. Glass
Publication date: 30 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (12)
An efficient genetic algorithm for job shop scheduling with tardiness objectives. ⋮ Minimizing the makespan in nonpreemptive parallel machine scheduling problem ⋮ Memetic algorithms: The polynomial local search complexity theory perspective ⋮ A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria ⋮ Scheduling and constraint propagation ⋮ A composite algorithm for multiprocessor scheduling ⋮ A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem ⋮ A computational study of the permutation flow shop problem based on a tight lower bound ⋮ Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration ⋮ Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs ⋮ Capacity scheduling for data services over digital networks ⋮ An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
This page was built for publication:
