The Schedule-Sequencing Problem

From MaRDI portal
Publication:4903786

DOI10.1287/opre.7.5.621zbMath1255.90059OpenAlexW2134098988MaRDI QIDQ4903786

Edward H. Bowman

Publication date: 26 January 2013

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.7.5.621



Related Items

On some sequencing problems, Dynamic resource allocation: a flexible and tractable modeling framework, A survey of job shop scheduling problem: the types and models, Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties, On the exact solution of the no-wait flow shop problem with due date constraints, Mixed integer programming models for job shop scheduling: A computational analysis, Evaluation of mathematical models for flexible job-shop scheduling problems, Multiple and bicriteria scheduling: A literature survey, Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters, A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems, Continuous-time formulations for multi-mode project scheduling, Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem, Resource-constrained project scheduling: A survey of recent developments., Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines, A time indexed formulation of non-preemptive single machine scheduling problems, Mathematical models for preemptive shop scheduling problems, Mixed binary integer programming formulations for the reentrant job shop scheduling problem, Event-based MILP models for resource-constrained project scheduling problems, On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation, Mathematical models for job-shop scheduling problems with routing and process plan flexibility, Mathematical Modeling of Scheduling Problems, Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut, A unified formulation of the machine scheduling problem, Deterministic job-shop scheduling: Past, present and future, Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation, The job shop scheduling problem: Conventional and new solution techniques, Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system, A study of integer programming formulations for scheduling problems, Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung, A decomposition approach to multi-project scheduling, A Taxonomy for the Flexible Job Shop Scheduling Problem, Mixed integer linear programming in process scheduling: modeling, algorithms, and applications