Resource-constrained scheduling with optional recycling operations

檔案

本條目沒有附加檔案。

日期

2015-12-01

期刊名稱

COMPUTERS & INDUSTRIAL ENGINEERING

摘要

This paper introduces a scheduling problem with a variant of resource constraint that stems from a relocation project. We also propose the concept of optional recycling operations, in which recycling operations are separated from the processing of jobs and recycling operations are exercised only when necessary. An integer program is proposed to formulate the problem and facilitate complexity classification. We propose a pseudo-polynomial time dynamic program, and then classify the complexity status of several restricted cases. (C) 2015 Elsevier Ltd. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料