- The Experience
- The Programs
- MBA Program
- MSx Program
- PhD Program
- Executive Education
- Stanford Ignite
- Research Fellows Program
- Summer Institute for General Management
- Stanford LEAD Certificate: Corporate Innovation
- Stanford Innovation & Entrepreneurship Certificate
- Executive Program for Nonprofit Leaders
- Executive Program in Social Entrepreneurship
- Executive Program for Education Leaders
- Stanford go.to.market
- Faculty & Research
- Insights
- Alumni
- Events
You are here
Job Shop Scheduling with Due Dates and Overtime Capability
Job Shop Scheduling with Due Dates and Overtime Capability
1972Working Paper No. 127
A scheduling procedure is proposed for the static job shop problem with job due dates and a shop with overtime capability. An example is used to demonstrate the procedure and the generation of trade-off curves relating overtime and tota tardiness for use in managerial evaluation of alternative schedules. Results are reported for a set of trial problems having 30 to 98 processing operations. An extension of the procedure is described for dynamic job shop scheduling.