Job-shop scheduling with processing alternatives.
From MaRDI portal
Publication:1410614
DOI10.1016/S0377-2217(02)00828-7zbMath1052.90033MaRDI QIDQ1410614
Publication date: 14 October 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)
Related Items
A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs, A disjunctive graph model and framework for constructing new train schedules, Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms, A tabu search approach for scheduling hazmat shipments, An effective heuristic algorithm for the partial shop scheduling problem, A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems, Production scheduling with alternative process plans, An enhanced genetic algorithm with an innovative encoding strategy for flexible job-shop scheduling with operation and processing flexibility, The job shop scheduling problem with convex costs, A sequencing approach for creating new train timetables, Maximising the weighted number of activity execution modes in project planning, Computing lower and upper bounds for a large-scale industrial job shop scheduling problem, A research survey: review of flexible job shop scheduling techniques, An agent-based negotiation approach to integrate process planning and scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The mixed shop scheduling problem
- Job-shop scheduling with multi-purpose machines
- Multi-resource shop scheduling with resource flexibility
- Constructive heuristic algorithms for the open shop problem
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- A branch \(\&\) bound algorithm for the open-shop problem
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Tabu-search for the multi-mode job-shop problem
- Insertion techniques for the heuristic solution of the job shop problem
- Complexity of mixed shop scheduling problems: A survey
- Effective neighbourhood functions for the flexible job shop problem
- Benchmarks for basic scheduling problems
- Routing and scheduling in a flexible job shop by tabu search
- Applying tabu search to the job-shop scheduling problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
- Computational Complexity of Discrete Optimization Problems