A binary multiple knapsack model for single machine scheduling with machine unavailability

This publication has 51 references indexed in Scilit:

• Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint
  Computers & Industrial Engineering, 2014
• A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer
  International Journal of Production Economics, 2013
• Scheduling Beams with Different Priorities on a Military Surveillance Radar
  IEEE Transactions on Aerospace and Electronic Systems, 2012
• Single machine scheduling with small operator-non-availability periods
  Journal of Scheduling, 2012
• Approximation schemes for parallel machine scheduling with availability constraints
  Discrete Applied Mathematics, 2011
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
  Applied Mathematical Modelling, 2010
• Variable neighbourhood search: methods and applications
  Annals of Operations Research, 2009
• Daily parking of subway vehicles
  1998
• Reducibility among Combinatorial Problems
  1972
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
  Management Science, 1968