2B3 A LOCAL SEARCH APPROACH FOR THE JOBSHOP SCHEDULING PROBLEM WITH DEADLINES AND CONTROLLABLE PROCESSING TIMES

スポンサーリンク

概要

• 論文の詳細を見る

• We consider the jobshop scheduling problem with deadlines and controllable processing times. For this problem, we propose a local search algorithm, in which we select neighboring solutions heuristically by estimating the solution quality approximately so that the computational effort is reduced. Our preliminary computational results suggest that our approach is promising.

• 2009-07-04

著者

• Nonobe Koji

  Department of Art and Technology, Hosei University

• Nonobe Koji

  Department Of Engineering And Design Hosei University

• Sakamoto Rihito

  Department of Engineering and Design, Hosei University

• Sakamoto Rihito

  Department Of Engineering And Design Hosei University

関連論文

• 6B2 AN ITERATED LOCAL SEARCH ALGORITHM FOR THE MULTI-RESOURCE GENERALIZED ASSIGNMENT PROBLEM WITH FLEXIBLE ASSIGNMENT COST(Technical session 6B: General model for scheduling and assignment problem)
• 2B3 A LOCAL SEARCH APPROACH FOR THE JOBSHOP SCHEDULING PROBLEM WITH DEADLINES AND CONTROLLABLE PROCESSING TIMES

スポンサーリンク