grouping stringclasses 2
values | instruction stringclasses 2
values | input stringlengths 766 3.86k | output stringlengths 223 3.54k |
|---|---|---|---|
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 7 Jobs across 8 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":0,"start":0,"end":175},{"operation_id":1,"machine":4,"start":175,"end":261},{"operation_id":2,"machine":7,"start":260,"end":343},{"operation_id":3,"machine":3,"start":343,"end":476},{"operation_id":4,"machine":5,"start":476,"end":637},{"operation_id":5,"machine":1,"start":637,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 8 Jobs across 3 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":2,"start":0,"end":80},{"operation_id":1,"machine":1,"start":80,"end":200},{"operation_id":2,"machine":0,"start":200,"end":275}],"job_3":[{"operation_id":0,"machine":0,"start":0,"end":139},{"operation_id":1,"machine":1,"start":681,"end":854},{"operation_id":2,"machine":2,"start":854... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 7 Jobs across 4 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_2":[{"operation_id":0,"machine":1,"start":0,"end":181},{"operation_id":1,"machine":0,"start":459,"end":598},{"operation_id":2,"machine":3,"start":646,"end":785},{"operation_id":3,"machine":2,"start":785,"end":928}],"job_3":[{"operation_id":0,"machine":2,"start":0,"end":28},{"operation_id":1,"machine":3,"start":28... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 5 Jobs across 7 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":2,"start":0,"end":150},{"operation_id":1,"machine":0,"start":150,"end":278},{"operation_id":2,"machine":3,"start":277,"end":414},{"operation_id":3,"machine":5,"start":414,"end":589},{"operation_id":4,"machine":1,"start":589,"end":711},{"operation_id":5,"machine":4,"start":711,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 6 Jobs across 8 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_1":[{"operation_id":0,"machine":7,"start":0,"end":156},{"operation_id":1,"machine":3,"start":156,"end":350},{"operation_id":2,"machine":0,"start":349,"end":482},{"operation_id":3,"machine":1,"start":482,"end":679},{"operation_id":4,"machine":4,"start":679,"end":859},{"operation_id":5,"machine":5,"start":859,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 6 Jobs across 7 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":6,"start":0,"end":82},{"operation_id":1,"machine":3,"start":82,"end":111},{"operation_id":2,"machine":5,"start":110,"end":296},{"operation_id":3,"machine":1,"start":326,"end":439},{"operation_id":4,"machine":0,"start":439,"end":464},{"operation_id":5,"machine":4,"start":479,"end":5... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 3 Jobs across 6 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":1,"start":0,"end":158},{"operation_id":1,"machine":4,"start":158,"end":244},{"operation_id":2,"machine":3,"start":257,"end":284},{"operation_id":3,"machine":2,"start":284,"end":365},{"operation_id":4,"machine":0,"start":365,"end":399},{"operation_id":5,"machine":5,"start":469,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 6 Jobs across 7 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_4":[{"operation_id":0,"machine":6,"start":0,"end":90},{"operation_id":1,"machine":2,"start":90,"end":127},{"operation_id":2,"machine":4,"start":126,"end":210},{"operation_id":3,"machine":5,"start":226,"end":334},{"operation_id":4,"machine":3,"start":725,"end":916},{"operation_id":5,"machine":0,"start":1085,"end":... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 8 Jobs across 6 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_2":[{"operation_id":0,"machine":0,"start":0,"end":31},{"operation_id":1,"machine":1,"start":31,"end":99},{"operation_id":2,"machine":4,"start":99,"end":133},{"operation_id":3,"machine":2,"start":133,"end":235},{"operation_id":4,"machine":5,"start":251,"end":445},{"operation_id":5,"machine":3,"start":964,"end":103... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 6 Jobs across 7 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_1":[{"operation_id":0,"machine":4,"start":0,"end":133},{"operation_id":1,"machine":3,"start":156,"end":338},{"operation_id":2,"machine":0,"start":358,"end":521},{"operation_id":3,"machine":1,"start":590,"end":692},{"operation_id":4,"machine":6,"start":692,"end":764},{"operation_id":5,"machine":5,"start":764,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 3 Jobs across 8 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":4,"start":0,"end":138},{"operation_id":1,"machine":2,"start":138,"end":158},{"operation_id":2,"machine":7,"start":157,"end":249},{"operation_id":3,"machine":0,"start":249,"end":433},{"operation_id":4,"machine":5,"start":433,"end":547},{"operation_id":5,"machine":3,"start":547,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 8 Jobs across 5 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_3":[{"operation_id":0,"machine":0,"start":0,"end":22},{"operation_id":1,"machine":4,"start":157,"end":260},{"operation_id":2,"machine":3,"start":260,"end":319},{"operation_id":3,"machine":2,"start":383,"end":574},{"operation_id":4,"machine":1,"start":820,"end":979}],"job_5":[{"operation_id":0,"machine":4,"start":... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 5 Jobs across 3 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_1":[{"operation_id":0,"machine":2,"start":0,"end":18},{"operation_id":1,"machine":0,"start":18,"end":186},{"operation_id":2,"machine":1,"start":186,"end":266}],"job_4":[{"operation_id":0,"machine":1,"start":0,"end":85},{"operation_id":1,"machine":0,"start":186,"end":245},{"operation_id":2,"machine":2,"start":245,... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 5 Jobs across 6 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":5,"start":0,"end":110},{"operation_id":1,"machine":1,"start":110,"end":291},{"operation_id":2,"machine":0,"start":290,"end":486},{"operation_id":3,"machine":2,"start":566,"end":610},{"operation_id":4,"machine":4,"start":610,"end":645},{"operation_id":5,"machine":3,"start":645,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 7 Jobs across 8 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":1,"start":0,"end":186},{"operation_id":1,"machine":6,"start":186,"end":300},{"operation_id":2,"machine":0,"start":321,"end":484},{"operation_id":3,"machine":3,"start":708,"end":862},{"operation_id":4,"machine":7,"start":862,"end":947},{"operation_id":5,"machine":2,"start":962,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 6 Jobs across 5 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_1":[{"operation_id":0,"machine":3,"start":0,"end":11},{"operation_id":1,"machine":2,"start":642,"end":755},{"operation_id":2,"machine":0,"start":755,"end":857},{"operation_id":3,"machine":1,"start":857,"end":999},{"operation_id":4,"machine":4,"start":999,"end":1092}],"job_2":[{"operation_id":0,"machine":2,"start"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 6 Jobs across 3 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_1":[{"operation_id":0,"machine":1,"start":0,"end":41},{"operation_id":1,"machine":0,"start":63,"end":91},{"operation_id":2,"machine":2,"start":580,"end":680}],"job_2":[{"operation_id":0,"machine":2,"start":0,"end":91},{"operation_id":1,"machine":0,"start":91,"end":253},{"operation_id":2,"machine":1,"start":521,"e... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 4 Jobs across 8 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":2,"start":0,"end":200},{"operation_id":1,"machine":7,"start":199,"end":327},{"operation_id":2,"machine":4,"start":327,"end":509},{"operation_id":3,"machine":1,"start":509,"end":533},{"operation_id":4,"machine":0,"start":533,"end":604},{"operation_id":5,"machine":6,"start":720,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 6 Jobs across 7 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":1,"start":0,"end":198},{"operation_id":1,"machine":2,"start":198,"end":381},{"operation_id":2,"machine":0,"start":380,"end":498},{"operation_id":3,"machine":4,"start":530,"end":635},{"operation_id":4,"machine":3,"start":635,"end":731},{"operation_id":5,"machine":5,"start":731,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 7 Jobs across 5 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_1":[{"operation_id":0,"machine":4,"start":0,"end":101},{"operation_id":1,"machine":1,"start":340,"end":481},{"operation_id":2,"machine":3,"start":481,"end":643},{"operation_id":3,"machine":2,"start":643,"end":835},{"operation_id":4,"machine":0,"start":835,"end":853}],"job_2":[{"operation_id":0,"machine":3,"start"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 6 Jobs across 3 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_1":[{"operation_id":0,"machine":2,"start":0,"end":133},{"operation_id":1,"machine":0,"start":541,"end":632},{"operation_id":2,"machine":1,"start":632,"end":675}],"job_2":[{"operation_id":0,"machine":1,"start":0,"end":38},{"operation_id":1,"machine":0,"start":232,"end":315},{"operation_id":2,"machine":2,"start":44... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 4 Jobs across 3 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":1,"start":0,"end":180},{"operation_id":1,"machine":2,"start":240,"end":329},{"operation_id":2,"machine":0,"start":329,"end":440}],"job_3":[{"operation_id":0,"machine":0,"start":0,"end":95},{"operation_id":1,"machine":2,"start":126,"end":240},{"operation_id":2,"machine":1,"start":30... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 8 Jobs across 6 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":3,"start":0,"end":10},{"operation_id":1,"machine":1,"start":10,"end":53},{"operation_id":2,"machine":4,"start":109,"end":306},{"operation_id":3,"machine":5,"start":687,"end":805},{"operation_id":4,"machine":2,"start":805,"end":965},{"operation_id":5,"machine":0,"start":965,"end":10... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 7 Jobs across 8 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_1":[{"operation_id":0,"machine":1,"start":0,"end":161},{"operation_id":1,"machine":7,"start":161,"end":266},{"operation_id":2,"machine":4,"start":265,"end":377},{"operation_id":3,"machine":3,"start":377,"end":564},{"operation_id":4,"machine":0,"start":564,"end":603},{"operation_id":5,"machine":2,"start":1026,"end... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 7 Jobs across 7 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_2":[{"operation_id":0,"machine":2,"start":0,"end":153},{"operation_id":1,"machine":1,"start":163,"end":259},{"operation_id":2,"machine":0,"start":259,"end":425},{"operation_id":3,"machine":3,"start":425,"end":595},{"operation_id":4,"machine":4,"start":595,"end":763},{"operation_id":5,"machine":6,"start":763,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 3 Jobs across 3 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":0,"start":0,"end":51},{"operation_id":1,"machine":2,"start":241,"end":419},{"operation_id":2,"machine":1,"start":419,"end":441}],"job_1":[{"operation_id":0,"machine":2,"start":0,"end":185},{"operation_id":1,"machine":0,"start":184,"end":264},{"operation_id":2,"machine":1,"start":26... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 4 Jobs across 6 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":5,"start":0,"end":97},{"operation_id":1,"machine":0,"start":97,"end":121},{"operation_id":2,"machine":4,"start":120,"end":154},{"operation_id":3,"machine":1,"start":715,"end":905},{"operation_id":4,"machine":3,"start":905,"end":971},{"operation_id":5,"machine":2,"start":971,"end":9... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 7 Jobs across 6 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":5,"start":0,"end":164},{"operation_id":1,"machine":1,"start":164,"end":175},{"operation_id":2,"machine":3,"start":174,"end":201},{"operation_id":3,"machine":4,"start":201,"end":319},{"operation_id":4,"machine":0,"start":319,"end":468},{"operation_id":5,"machine":2,"start":478,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 7 Jobs across 5 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":4,"start":0,"end":68},{"operation_id":1,"machine":0,"start":68,"end":258},{"operation_id":2,"machine":3,"start":258,"end":390},{"operation_id":3,"machine":2,"start":572,"end":607},{"operation_id":4,"machine":1,"start":654,"end":671}],"job_2":[{"operation_id":0,"machine":0,"start":0... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 5 Jobs across 6 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_1":[{"operation_id":0,"machine":4,"start":0,"end":36},{"operation_id":1,"machine":2,"start":36,"end":184},{"operation_id":2,"machine":1,"start":184,"end":322},{"operation_id":3,"machine":5,"start":321,"end":353},{"operation_id":4,"machine":3,"start":404,"end":468},{"operation_id":5,"machine":0,"start":468,"end":5... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 8 Jobs across 3 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_1":[{"operation_id":0,"machine":0,"start":0,"end":101},{"operation_id":1,"machine":2,"start":131,"end":300},{"operation_id":2,"machine":1,"start":1092,"end":1161}],"job_3":[{"operation_id":0,"machine":1,"start":0,"end":51},{"operation_id":1,"machine":2,"start":300,"end":493},{"operation_id":2,"machine":0,"start":... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 8 Jobs across 7 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_1":[{"operation_id":0,"machine":4,"start":0,"end":37},{"operation_id":1,"machine":2,"start":160,"end":259},{"operation_id":2,"machine":6,"start":259,"end":348},{"operation_id":3,"machine":0,"start":348,"end":481},{"operation_id":4,"machine":3,"start":713,"end":879},{"operation_id":5,"machine":5,"start":1060,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 5 Jobs across 6 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":2,"start":0,"end":105},{"operation_id":1,"machine":3,"start":105,"end":244},{"operation_id":2,"machine":5,"start":243,"end":430},{"operation_id":3,"machine":0,"start":429,"end":595},{"operation_id":4,"machine":1,"start":595,"end":733},{"operation_id":5,"machine":4,"start":733,"end"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 6 Jobs across 5 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":2,"start":0,"end":184},{"operation_id":1,"machine":0,"start":413,"end":585},{"operation_id":2,"machine":1,"start":585,"end":699},{"operation_id":3,"machine":4,"start":699,"end":810},{"operation_id":4,"machine":3,"start":810,"end":955}],"job_1":[{"operation_id":0,"machine":0,"start"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 5 Jobs across 5 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":4,"start":0,"end":101},{"operation_id":1,"machine":2,"start":139,"end":252},{"operation_id":2,"machine":3,"start":424,"end":547},{"operation_id":3,"machine":1,"start":547,"end":740},{"operation_id":4,"machine":0,"start":792,"end":929}],"job_1":[{"operation_id":0,"machine":2,"start"... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 6 Jobs across 7 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_1":[{"operation_id":0,"machine":3,"start":0,"end":38},{"operation_id":1,"machine":2,"start":198,"end":235},{"operation_id":2,"machine":1,"start":235,"end":357},{"operation_id":3,"machine":5,"start":357,"end":384},{"operation_id":4,"machine":0,"start":458,"end":471},{"operation_id":5,"machine":4,"start":471,"end":... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 8 Jobs across 3 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_3":[{"operation_id":0,"machine":0,"start":0,"end":10},{"operation_id":1,"machine":1,"start":633,"end":739},{"operation_id":2,"machine":2,"start":739,"end":853}],"job_7":[{"operation_id":0,"machine":1,"start":0,"end":55},{"operation_id":1,"machine":2,"start":55,"end":181},{"operation_id":2,"machine":0,"start":254,... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 8 Jobs across 5 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":0,"start":0,"end":158},{"operation_id":1,"machine":4,"start":543,"end":670},{"operation_id":2,"machine":1,"start":670,"end":684},{"operation_id":3,"machine":2,"start":684,"end":850},{"operation_id":4,"machine":3,"start":879,"end":1047}],"job_2":[{"operation_id":0,"machine":2,"start... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 5 Jobs across 3 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":2,"start":0,"end":153},{"operation_id":1,"machine":0,"start":494,"end":649},{"operation_id":2,"machine":1,"start":649,"end":732}],"job_3":[{"operation_id":0,"machine":1,"start":0,"end":183},{"operation_id":1,"machine":0,"start":193,"end":283},{"operation_id":2,"machine":2,"start":3... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 6 Jobs across 8 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":1,"start":0,"end":12},{"operation_id":1,"machine":4,"start":269,"end":393},{"operation_id":2,"machine":7,"start":697,"end":815},{"operation_id":3,"machine":5,"start":815,"end":848},{"operation_id":4,"machine":2,"start":848,"end":926},{"operation_id":5,"machine":6,"start":926,"end":... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 8 Jobs across 5 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_2":[{"operation_id":0,"machine":3,"start":0,"end":148},{"operation_id":1,"machine":1,"start":302,"end":384},{"operation_id":2,"machine":2,"start":384,"end":505},{"operation_id":3,"machine":0,"start":764,"end":944},{"operation_id":4,"machine":4,"start":1104,"end":1172}],"job_3":[{"operation_id":0,"machine":1,"star... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 4 Jobs across 3 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_2":[{"operation_id":0,"machine":0,"start":0,"end":187},{"operation_id":1,"machine":2,"start":187,"end":257},{"operation_id":2,"machine":1,"start":316,"end":484}],"job_3":[{"operation_id":0,"machine":1,"start":0,"end":38},{"operation_id":1,"machine":0,"start":187,"end":355},{"operation_id":2,"machine":2,"start":35... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 6 Jobs across 6 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":2,"start":0,"end":37},{"operation_id":1,"machine":4,"start":74,"end":211},{"operation_id":2,"machine":0,"start":211,"end":306},{"operation_id":3,"machine":5,"start":485,"end":537},{"operation_id":4,"machine":3,"start":712,"end":814},{"operation_id":5,"machine":1,"start":814,"end":9... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 8 Jobs across 4 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_2":[{"operation_id":0,"machine":3,"start":0,"end":194},{"operation_id":1,"machine":0,"start":923,"end":954},{"operation_id":2,"machine":1,"start":954,"end":965},{"operation_id":3,"machine":2,"start":1073,"end":1217}],"job_4":[{"operation_id":0,"machine":0,"start":0,"end":25},{"operation_id":1,"machine":3,"start":... |
job | Produce a makespan‑optimal schedule in JSON. | Give a detailed solution to tackle the Job Shop Scheduling problem, focusing on optimizing the makespan. Schedule for 3 Jobs across 5 Machines to minimize makespan.
Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine... | {"job_0":[{"operation_id":0,"machine":4,"start":0,"end":92},{"operation_id":1,"machine":3,"start":92,"end":230},{"operation_id":2,"machine":2,"start":229,"end":263},{"operation_id":3,"machine":0,"start":263,"end":398},{"operation_id":4,"machine":1,"start":514,"end":693}],"job_1":[{"operation_id":0,"machine":0,"start":0... |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 3