The schedule-sequencing problem
From MaRDI portal
Publication:4903786
Recommendations
Cited in
(46)- Mathematical models for preemptive shop scheduling problems
- A study of integer programming formulations for scheduling problems
- Improved linear programming relaxations for flow shop problems with makespan minimization
- Classification and comparison of integer programming formulations for the single-machine sequencing problem
- Mixed binary integer programming formulations for the reentrant job shop scheduling problem
- A Taxonomy for the Flexible Job Shop Scheduling Problem
- Event-based MILP models for resource-constrained project scheduling problems
- Determination of feasible shipping schedules for a job shop
- Dynamic resource allocation: a flexible and tractable modeling framework
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
- A time indexed formulation of non-preemptive single machine scheduling problems
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- scientific article; zbMATH DE number 4076943 (Why is no real title available?)
- 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
- Optimizing job shop scheduling with speed-adjustable machines and peak power constraints: a mathematical model and heuristic solutions
- A unified formulation of the machine scheduling problem
- On the exact solution of the no-wait flow shop problem with due date constraints
- Structured solutions in scheduling problems
- scientific article; zbMATH DE number 1882989 (Why is no real title available?)
- On some sequencing problems
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
- Theory and methodology of time-dependent scheduling: past, present and future
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- Mixed integer programming models for job shop scheduling: A computational analysis
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- The job shop scheduling problem: Conventional and new solution techniques
- scientific article; zbMATH DE number 3843480 (Why is no real title available?)
- Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut
- Continuous-time formulations for multi-mode project scheduling
- Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters
- Evaluation of mathematical models for flexible job-shop scheduling problems
- scientific article; zbMATH DE number 4189460 (Why is no real title available?)
- scientific article; zbMATH DE number 3941253 (Why is no real title available?)
- scientific article; zbMATH DE number 3978803 (Why is no real title available?)
- Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements
- Deterministic job-shop scheduling: Past, present and future
- scientific article; zbMATH DE number 4170624 (Why is no real title available?)
- 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
- Multiple and bicriteria scheduling: A literature survey
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Mathematical Modeling of 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)
