Sequencing and Scheduling

 

 

 
• Sequencing on One Processor
  • SS1 M AXIMUM C ONSTRAINED S EQUENCING TO M INIMIZE T ARDY T ASK W EIGHT
  • SS2 M INIMUM S TORAGE -T IME S EQUENCING
  • SS3 M INIMUM P RECEDENCE C ONSTRAINED S EQUENCING WITH D ELAYS
  • SS4 M INIMUM S EQUENCING WITH R ELEASE T IMES
  • SS5 M INIMUM T IME -C OST T RADEOFF
• Multiprocessor Scheduling
  • SS6 M INIMUM M ULTIPROCESSOR S CHEDULING
  • SS7 M INIMUM P RECEDENCE C ONSTRAINED S CHEDULING
  • SS8 M INIMUM R ESOURCE C ONSTRAINED S CHEDULING
  • SS9 M INIMUM P REEMPTIVE S CHEDULING WITH S ET -U P T IMES
  • SS10 M INIMUM M ULTIPROCESSOR S CHEDULING WITH S PEED F ACTORS
  • SS11 M INIMUM P ARALLEL P ROCESSOR T OTAL F LOW T IME
  • SS12 M INIMUM W EIGHTED C OMPLETION T IME S CHEDULING
  • SS13 M INIMUM 3-D EDICATED P ROCESSOR S CHEDULING
• Shop Scheduling
  • SS14 M INIMUM O PEN -S HOP S CHEDULING
  • SS15 M INIMUM F LOW -S HOP S CHEDULING
  • SS16 M INIMUM T WO -P ROCESSOR F LOW -S HOP S CHEDULING WITH B ATCH S ET -U P T IMES
  • SS17 M INIMUM J OB S HOP S CHEDULING
• Miscellaneous
  • SS18 M INIMUM F ILE T RANSFER S CHEDULING
  • SS19 M INIMUM S CHEDULE L ENGTH
  • SS20 M INIMUM V EHICLE S CHEDULING ON T REE