Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times

Mathematics

• Sequence-dependent Setup Times 100%
• Total Completion Time 90%
• Parallel Machines 82%
• Heuristic algorithm 74%
• Exact Algorithms 70%
• Scheduling Problem 64%
• Resources 58%
• Sequence-dependent Setups 39%
• Programming Model 36%
• Integer Programming 34%
• Horizon 33%
• Heuristics 27%
• Photolithography 20%
• Lithography 17%
• Deterministic Scheduling 17%
• Manufacturing Industries 16%
• Scheduling Theory 15%
• Parallel Machine Scheduling 15%
• Identical Parallel Machines 15%
• Release Dates 15%
• Setup Times 14%
• Hybrid Model 14%
• Lens 13%
• Formulation 13%
• Completion Time 12%
• Search Space 12%
• Semiconductors 12%
• Schedule 11%
• Industry 10%
• Scheduling 10%
• Eliminate 10%
• Control Problem 8%
• Optimal Solution 8%
• Costs 7%
• Strategy 7%
• Design 6%

Business & Economics

• Time Scheduling 92%
• Sequence-dependent Setup Times 87%
• Total Completion Time 84%
• Parallel Machines 80%
• Heuristic Algorithm 71%
• Scheduling Problem 56%
• Integer Programming 51%
• Resource-Constrained Scheduling 49%
• Time Horizon 46%
• Resources 39%
• Heuristics 37%
• Hybrid Model 23%
• Parallel Machine Scheduling 21%
• Release Dates 20%
• Setup Times 18%
• Semiconductor Industry 17%
• Design and Development 17%
• Capital Cost 16%
• Capital Investment 14%
• Optimal Solution 13%
• Manufacturing Industries 12%
• Schedule 12%

Engineering & Materials Science

• Heuristic algorithms 62%
• Scheduling 43%
• Integer programming 40%
• Photolithography 15%
• Lithography 13%
• Lenses 12%
• Semiconductor materials 11%
• Industry 10%
• Costs 4%