The schedule-sequencing problem

DOI10.1287/OPRE.7.5.621zbMATH Open1255.90059OpenAlexW2134098988MaRDI QIDQ4903786FDOQ4903786

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

Recommendations

• Dynamic problems of scheduling
• The generalized scheduling problem for discrete production. II
• Sequential and parallel computations in the general scheduling problem
• scientific article
• scientific article

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (42)

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

This page was built for publication: The schedule-sequencing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903786)