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: