Objectives

The objectives of IJPS are to promote and disseminate the latest theoretical and applied research in the area of planning and scheduling in various fields of application. IJPS will facilitate the fostering and sharing of knowledge among academia, research institutions, government and industrial organisations. IJPS will be a forum for a lively, interdisciplinary discussion of the entire range of issues surrounding planning and scheduling. The specific objectives are achieved through original publications that support one or more of the following major research thrusts:

• Presenting new and innovative models and methods: IJPS encourages papers that introduce new and innovative models that redefine planning and scheduling problems and put them in the modern enterprise context. Innovative research on solution methods for established models certainly remains of interest, and submissions from all areas of methodology are welcome.
• Bridging the gap between theory and practice: IJPS encourages papers that contribute to bridging the gap between theoretical and applied research - helping practitioners utilise the latest developments in solving real-world problems and helping academics become aware of such problems and their context.
• Taking interdisciplinary approaches: IJPS encourages papers that highlight the interfaces among areas of operations research, information technology, artificial intelligence, and computer science.
• Improving the education process: IJPS encourages papers that promote educational aspects of planning and scheduling, with space devoted to reviews of teaching materials and to rigorous papers on the implementation and assessment of innovative teaching techniques.

Readership

IJPS is a global forum that serves as an outlet of knowledge dissemination for academics, educators, researchers, and practitioners in the field of planning and scheduling to share their latest research findings.

Contents

IJPS publishes original papers, review papers, book reviews, and technical notes. Case studies can be accepted if they have a clear and significant contribution toward bridging the gap between the theory and application in real world applications. Special Issues will also be considered for important and cutting edge topics in planning and scheduling. The content encompasses the following methods when they apply to planning and scheduling problems: exact methods, mathematical programming (linear, nonlinear, and integer programming), constraint programming, heuristic and approximate algorithms, local search, metaheuristics, complexity analysis, theoretical frameworks and analysis.