scientific article; zbMATH DE number 1082109
From MaRDI portal
Publication:4365136
Single-machine, parallel-machine and shop scheduling problems tackled by local search methods are surveyed. In addition to reviewing the literature and presenting results of computational tests, the article builds a framework for the application of local search methods to various scheduling problems. For the entire collection see [Zbl 0869.00019].
Recommendations
- Scheduling of a machining center
- Scheduling a batching machine
- Scheduling with machine cost
- scientific article; zbMATH DE number 1235242
- Scheduling with machine conflicts
- Machine scheduling with job delivery coordination
- New trends in machine scheduling
- Machine scheduling with availability constraints
- Scheduling a Flexible Batching Machine
- Machine scheduling with resource dependent processing times
Cited in
(31)- New trends in machine scheduling
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
- Generalized pairwise interchanges and machine scheduling
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
- A tabu search algorithm for scheduling a single robot in a job-shop environment
- A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria
- A computational study of the permutation flow shop problem based on a tight lower bound
- Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
- Machine scheduling in production: a content analysis
- Memetic algorithms: The polynomial local search complexity theory perspective
- A local search using solution fragments for the 2-machine bicriteria scheduling problem
- scientific article; zbMATH DE number 2086186 (Why is no real title available?)
- scientific article; zbMATH DE number 4039626 (Why is no real title available?)
- scientific article; zbMATH DE number 4091174 (Why is no real title available?)
- Scheduling in computer and manufacturing systems
- Equipment Selection and Machine Scheduling in General Mail Facilities
- scientific article; zbMATH DE number 1031416 (Why is no real title available?)
- An iterated local search algorithm for a place scheduling problem
- A machine-order search space for job-shop scheduling problems
- Minimization of open orders: application of a re-distribution coordination policy
- Global Search Method for Parallel Machine Scheduling
- A composite algorithm for multiprocessor scheduling
- Job Shop Scheduling by Local Search
- scientific article; zbMATH DE number 2221022 (Why is no real title available?)
- Capacity scheduling for data services over digital networks
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem
- Scheduling and constraint propagation
- Local adjustments: A general algorithm
- A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4365136)
