An iterative improvement approach for the nonpreemptive open shop scheduling problem
From MaRDI portal
Publication:1806862
DOI10.1016/S0377-2217(97)00366-4zbMATH Open0937.90032MaRDI QIDQ1806862FDOQ1806862
Authors: Ching-Fang Liaw 
Publication date: 14 June 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- The open shop scheduling problem with a given sequence of jobs on one machine
- An open shop scheduling problem with a non-bottleneck machine
- A tabu search algorithm for the open shop scheduling problem
- Scheduling preemptive open shops to minimize total tardiness
- scientific article; zbMATH DE number 764418
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Open Shop Scheduling to Minimize Finish Time
- Open-shop scheduling problems with dominated machines
- Approximation Algorithms for Three-Machine Open Shop Scheduling
- Title not available (Why is that?)
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
- Title not available (Why is that?)
- An Algorithm for the Open-Shop Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- Bounds and initial solutions for frame ineration in machine scheduling
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
- Integrated model for supplier selection and negotiation in a make-to-order environment
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization
- The museum visitor routing problem
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- A contribution and new heuristics for open shop scheduling
- Title not available (Why is that?)
- A selecting method of reasonable non-dominated schedules on open shop
- New efficient heuristics for scheduling open shops with makespan minimization
- Solving the open shop scheduling problem
- A hybrid genetic algorithm for the open shop scheduling problem
This page was built for publication: An iterative improvement approach for the nonpreemptive open shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806862)
