The Scientific World Journal

New Developments in Scheduling Applications


Publishing date
04 Apr 2014
Status
Published
Submission deadline
24 Jan 2014

1Department of Industrial Engineering, Erciyes University, 38039 Kayseri, Turkey

2Business School, the University of Sydney, Darlington, NSW, 2006, Australia

3Universidade do Porto, Faculdade de Engenharia, Departamento de Engenharia Informática, Lab. de Int. Artificial e Ciência dos Computadores, Rua Dr. Roberto Frias, 4200-465 Porto, Portugal


New Developments in Scheduling Applications

Description

Scheduling problems are very varied, both in application domains and in featured constraints. Most of these problems are computationally hard to solve (in the sense of being NP-complete) and need complex algorithms. Nowadays, researchers have been working on scheduling problems derived from new applications such as scheduling problems in logistical airport operations management processes, decentralized systems and selfish organizations, grid computing, and bioinformatics. These scheduling problems reflect real-life situations for including learning effects or deteriorating jobs.

We invite investigators to contribute original research articles as well as review articles that will stimulate the continuing efforts to understand the scheduling problems and their solving methods. We are particularly interested in articles describing the new solving approaches for single- or multimachine scheduling problems under some constraints and conditions, scheduling in multistage, and flexible systems. Potential topics include, but are not limited to:

  • Scheduling in a supply chain
  • Scheduling heuristics
  • Scheduling in the service systems
  • Project scheduling
  • Scheduling with some effects such as learning and deterioration
  • Grouping and sequencing operations in multistage systems
  • Scheduling in flexible shops
  • Scheduling under some constraints such as precedence, batching/lot sizing, setups, and further technologies
  • Scheduling under uncertainty

Before submission, authors should carefully read over the journal’s Author Guidelines, which are located at http://www.hindawi.com/journals/tswj/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/tswj/operations.research/depro/ according to the following timetable:


Articles

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

New Developments in Scheduling Applications

M. Duran Toksarı | Daniel Oron | ... | Jorge G. Barbosa
  • Special Issue
  • - Volume 2014
  • - Article ID 924120
  • - Research Article

Integrated Project Scheduling and Staff Assignment with Controllable Processing Times

Victor Fernandez-Viagas | Jose M. Framinan
  • Special Issue
  • - Volume 2014
  • - Article ID 949527
  • - Research Article

A Heuristic for Disassembly Planning in Remanufacturing System

Jinmo Sung | Bongju Jeong
  • Special Issue
  • - Volume 2014
  • - Article ID 356364
  • - Research Article

Parallel-Batch Scheduling and Transportation Coordination with Waiting Time Constraint

Hua Gong | Daheng Chen | Ke Xu
  • Special Issue
  • - Volume 2014
  • - Article ID 505207
  • - Research Article

Fuzzy Mixed Assembly Line Sequencing and Scheduling Optimization Model Using Multiobjective Dynamic Fuzzy GA

Farzad Tahriri | Siti Zawiah Md Dawal | Zahari Taha
  • Special Issue
  • - Volume 2014
  • - Article ID 756178
  • - Research Article

A Time Scheduling Model of Logistics Service Supply Chain Based on the Customer Order Decoupling Point: A Perspective from the Constant Service Operation Time

Weihua Liu | Yi Yang | ... | Zhicheng Liang
  • Special Issue
  • - Volume 2014
  • - Article ID 547573
  • - Research Article

Best Possible Approximation Algorithms for Single Machine Scheduling with Increasing Linear Maintenance Durations

Xuefei Shi | Dehua Xu
  • Special Issue
  • - Volume 2014
  • - Article ID 576234
  • - Research Article

Semi-Online Scheduling on Two Machines with GoS Levels and Partial Information of Processing Time

Taibo Luo | Yinfeng Xu
  • Special Issue
  • - Volume 2014
  • - Article ID 949726
  • - Research Article

Computing the Expected Cost of an Appointment Schedule for Statistically Identical Customers with Probabilistic Service Times

Dennis C. Dietz
The Scientific World Journal
 Journal metrics
See full report
Acceptance rate19%
Submission to final decision97 days
Acceptance to publication19 days
CiteScore2.400
Journal Citation Indicator-
Impact Factor-
 Submit

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