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 2013
  • - Article ID 659297
  • - Research Article

An Iterated Local Search Algorithm for a Place Scheduling Problem

Shicheng Hu | Zhaoze Zhang | ... | Xuedong Sun
  • Special Issue
  • - Volume 2013
  • - Article ID 389120
  • - Research Article

Single-Machine Scheduling with Job Rejection, Deteriorating Effects, and Deteriorating Maintenance Activities

Haiwei Nian | Zhizhong Mao
  • Special Issue
  • - Volume 2013
  • - Article ID 957494
  • - Research Article

A Note on a Fully Polynomial-Time Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

Long Wan
  • Special Issue
  • - Volume 2013
  • - Article ID 753123
  • - Research Article

Flowshop Scheduling Problems with a Position-Dependent Exponential Learning Effect

Mingbao Cheng
  • Special Issue
  • - Volume 2013
  • - Article ID 138240
  • - Research Article

Rescheduling Problems with Agreeable Job Parameters to Minimize the Tardiness Costs under Deterioration and Disruption

Zhang Xingong | Wang Yong
  • Special Issue
  • - Volume 2013
  • - Article ID 805261
  • - Research Article

Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times

Peng Liu | Xiaoyu Tian
  • Special Issue
  • - Volume 2013
  • - Article ID 648082
  • - Research Article

A Two-Agent Single-Machine Scheduling Problem with Learning and Deteriorating Considerations

Wen-Hsiang Wu
  • Special Issue
  • - Volume 2013
  • - Article ID 754826
  • - Research Article

Competitive Two-Agent Scheduling with Learning Effect and Release Times on a Single Machine

Der-Chiang Li | Peng-Hsiang Hsu
  • Special Issue
  • - Volume 2013
  • - Article ID 806325
  • - Research Article

Two-Agent Single-Machine Scheduling of Jobs with Time-Dependent Processing Times and Ready Times

Jan-Yee Kung | Yuan-Po Chao | ... | Win-Chin Lin
Mathematical Problems in Engineering
 Journal metrics
See full report
Acceptance rate11%
Submission to final decision118 days
Acceptance to publication28 days
CiteScore2.600
Journal Citation Indicator-
Impact Factor-
 Submit Evaluate your manuscript with the free Manuscript Language Checker

We have begun to integrate the 200+ Hindawi journals into Wiley’s journal portfolio. You can find out more about how this benefits our journal communities on our FAQ.