Solving an unrelated parallel machines scheduling problem with machine- and job-dependent setups and precedence constraints considering support machines

Cites Work

Unnamed Item
Unnamed Item
Optimization by Simulated Annealing
Unrelated parallel machine scheduling -- perspectives and progress
Parallel machines scheduling with nonsimultaneous machine available time
Minimizing the number of tardy job units under release time constraints
Analysis of a linear programming heuristic for scheduling unrelated parallel machines
Future paths for integer programming and links to artificial intelligence
Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
A framework for the complexity of high-multiplicity scheduling problems
Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping
Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times
A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times
Simultaneous Product-Mix Planning, Lot Sizing and Scheduling at Bottleneck Facilities
A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Reducibility among Combinatorial Problems
Dynamically scheduling and maintaining a flexible server

This page was built for publication: Solving an unrelated parallel machines scheduling problem with machine- and job-dependent setups and precedence constraints considering support machines

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