Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure (Q1600885): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Computational Study of the Job-Shop Scheduling Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Branch-Bound Solution to the General Scheduling Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3525910 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling in a sequence dependent setup environment with genetic search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Insertion techniques for the heuristic solution of the job shop problem / rank | |||
Normal rank | |||
Latest revision as of 10:56, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure |
scientific article |
Statements
Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure (English)
0 references
16 June 2002
0 references
optimization
0 references
paper-converting industry
0 references
single-machine scheduling
0 references
sequence-dependent setup times
0 references
0 references
