Bilevel programming applied to the flow shop scheduling problem (Q1915962): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-Level Linear Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing Job Idleness in Deadline Constrained Environments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing the Number of Machine Idle Intervals with Minimum Makespan in a Flow-Shop / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling the Open Shop to Minimize Mean Flow Time / rank | |||
Normal rank |
Latest revision as of 12:56, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bilevel programming applied to the flow shop scheduling problem |
scientific article |
Statements
Bilevel programming applied to the flow shop scheduling problem (English)
0 references
1 July 1996
0 references
two level branch and bound
0 references
flow-shop scheduling
0 references
bilevel programming
0 references
total flowtime
0 references
makespan
0 references
0 references