Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling (Q870153): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2006.06.092 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.06.092 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994775122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop scheduling problems with no-wait jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpreemptive flowshop scheduling with machine dominance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation flowshop scheduling problems with maximal and minimal time lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling research after five decades / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of exact solution methods for the non-preemptive multiprocessor flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed binary integer programming formulations for the reentrant job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two models for a family of flowshop sequencing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative evaluation of MILP flowshop models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ‘redundant’ constraints in Stafford's MILP model for the flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop scheduling with two criteria: maximum earliness and makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two MILP models for the N × M SDST flowshop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with job class setups to minimize total flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2006.06.092 / rank
 
Normal rank

Latest revision as of 06:18, 10 December 2024

scientific article
Language Label Description Also known as
English
Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling
scientific article

    Statements

    Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling (English)
    0 references
    0 references
    0 references
    12 March 2007
    0 references
    scheduling
    0 references
    flow shop scheduling problem
    0 references
    mixed binary integer programming
    0 references
    projects scheduling
    0 references

    Identifiers