We need to schedule some jobs on a set of machines. The jobs may have different characteristics, such as processing times, priorities, and precedents. The machines may have different characteristics, such as processing power and capabilities. The objective could be to minimize the makespan (total length of the schedule), meet deadlines, minimize cost, or some other requirement.
Key features of this model:
- Description: Runs several job shop variations, including visualization of the resulting schedules.
- Category: Job shop.
- Type: MILP.
- Library: Pyomo.
- Solver: CBC and CPLEX.
The model has been modified:
- Added environmental variable for email address to use CPLEX via NEOS Server. Replace with your email address.