Bi-criterion single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times
出版年份 2016 全文链接
标题
Bi-criterion single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times
作者
关键词
-
出版物
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume 67, Issue 9, Pages 1169-1183
出版商
Informa UK Limited
发表日期
2016-03-23
DOI
10.1057/jors.2016.14
参考文献
相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。- A survey on scheduling problems with due windows
- (2015) Adam Janiak et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Scheduling with a due-window for acceptable lead-times
- (2015) Enrique Gerstl et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Single machine group scheduling with time dependent processing times and ready times
- (2014) Ji-Bo Wang et al. INFORMATION SCIENCES
- Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity
- (2013) Min Ji et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Single-machine batch delivery scheduling with an assignable common due date and controllable processing times
- (2013) Yunqiang Yin et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Scheduling problems with multiple due windows assignment and controllable processing times on a single machine
- (2013) Dar-Li Yang et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times
- (2013) Yunqiang Yin et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time
- (2013) Y Yin et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Single-machine scheduling with common due-window assignment for deteriorating jobs
- (2013) J Liu et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
- (2012) Adam Janiak et al. INFORMATION SCIENCES
- Single-machine batch delivery scheduling with an assignable common due window
- (2012) Yunqiang Yin et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models
- (2011) Agnieszka Rudek et al. COMPUTERS & MATHEMATICS WITH APPLICATIONS
- Scheduling a maintenance activity and due-window assignment based on common flow allowance
- (2011) Baruch Mor et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system
- (2011) Dvir Shabtay et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Scheduling with due date assignment under special conditions on job processing
- (2011) Valery Gordon et al. JOURNAL OF SCHEDULING
- Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity
- (2010) T.C.E. Cheng et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- (2010) Dvir Shabtay et al. JOURNAL OF SCHEDULING
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
- (2009) Christos Koulamas et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Optimal delivery time quotation to minimize total tardiness penalties with controllable processing times
- (2009) Yaron Leyvand et al. IIE TRANSACTIONS
- Parallel machine scheduling with common due windows
- (2009) R-H Huang et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs
- (2009) Wing-Kwan Yeung et al. NAVAL RESEARCH LOGISTICS
Create your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create NowAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started