Mathematical Problems in Engineering

Scheduling with Time-depending Processing Times


Publishing date
10 Jan 2014
Status
Published
Submission deadline
23 Aug 2013

Lead Editor

1College of Sciences, East China Institute of Technology, Nanchang, 330013, China

2Department of Logistics and Maritime Studies, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

3Department of Statistics, Feng Chia University, Taichung, Taiwan


Scheduling with Time-depending Processing Times

Description

Nowadays, customer demand for order variety, short-lead time, and fast delivery has created a great impact on manufacturing problems such as production scheduling, job sequencing, vehicle routing, binpacking, and loading. Addressing the related problems of machine scheduling is even more crucial than ever. For many years, most scheduling research has focused on problems with deterministic parameters. In real-life applications, many systems exhibit dynamic behavior characterized by a set of dynamic parameters. This fact is commonly recognized in control theory, systems engineering, and many other areas. Scheduling with time-dependent processing times is one of these important models. Research on time-dependent problems has spawned a new area in the scheduling field. It has uncovered many new properties that are absent in classical scheduling theory and led to new methodological approaches to algorithm design and NP-complete reduction. Due to their theoretical challenges and practical values, scheduling with time-dependent processing times has attracted a considerable amount of research attention in the literature.

This special issue is devoted to publishing original and significant results on “scheduling with time-dependent processing times” This special issue will cover a wide range of topics covering new theory development, innovative modelling and analysis, fundamental methodological breakthroughs, and novel applications. Papers can be theoretical, methodological, computational, or applicationoriented. Potential topics include, but are not limited to:

  • Scheduling with learning effects
  • Scheduling with aging effects
  • New models for scheduling with time-dependent processing times
  • New methods for dealing with scheduling with time-dependent processing times

Before submission authors should carefully read over the journal’s Author Guidelines, which are located at http://www.hindawi.com/journals/mpe/guidelines/. Prospective authors should submit an electronic copy of their complete manuscript through the journal Manuscript Tracking System at http://mts.hindawi.com/submit/journals/mpe/tpt/ according to the following timetable:


Articles

  • Special Issue
  • - Volume 2014
  • - Article ID 201421
  • - Editorial

Scheduling with Time-Dependent Processing Times

Yunqiang Yin | T. C. E. Cheng | Chin-Chia Wu
  • Special Issue
  • - Volume 2014
  • - Article ID 249493
  • - Research Article

A Genetic Algorithm-Based Approach for Single-Machine Scheduling with Learning Effect and Release Time

Der-Chiang Li | Peng-Hsiang Hsu | Chih-Chieh Chang
  • Special Issue
  • - Volume 2014
  • - Article ID 537409
  • - Research Article

Integrated Inventory Routing Problem with Quality Time Windows and Loading Cost for Deteriorating Items under Discrete Time

Tao Jia | Xiaofan Li | ... | Ran Li
  • Special Issue
  • - Volume 2013
  • - Article ID 436701
  • - Research Article

Scheduling Semiconductor Multihead Testers Using Metaheuristic Techniques Embedded with Lot-Specific and Configuration-Specific Information

Yi-Feng Hung | Chi-Chung Wang | Gen-Han Wu
  • Special Issue
  • - Volume 2013
  • - Article ID 218981
  • - Research Article

Minimizing the Makespan for Scheduling Problems with General Deterioration Effects

Xianyu Yu | Yulin Zhang | Kai Huang
  • Special Issue
  • - Volume 2013
  • - Article ID 184706
  • - Research Article

Multistep Scheduling Algorithm for Parallel and Distributed Processing in Heterogeneous Systems with Communication Costs

Hitoshi Yamazaki | Katsumi Konishi | ... | Kenji Sawada
  • Special Issue
  • - Volume 2013
  • - Article ID 972358
  • - Research Article

Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine

Jianbo Qian | George Steiner
  • Special Issue
  • - Volume 2013
  • - Article ID 124083
  • - Research Article

A Competitive Two-Agent Scheduling Problem on Parallel Machines with Release Dates and Preemption

Yawei Qi | Long Wan
  • Special Issue
  • - Volume 2013
  • - Article ID 816235
  • - Research Article

Single-Machine Scheduling with Accelerating Learning Effects

T. C. E. Cheng | Shih-Chang Tseng | ... | Wen-Chiung Lee
  • Special Issue
  • - Volume 2013
  • - Article ID 634503
  • - Research Article

Single-Machine Scheduling with Aging Effects and Optional Maintenance Activity Considerations

Chou-Jung Hsu
Mathematical Problems in Engineering
 Journal metrics
Acceptance rate27%
Submission to final decision64 days
Acceptance to publication34 days
CiteScore1.800
Journal Citation Indicator0.400
Impact Factor1.305
 Submit

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.