Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (Q1640598): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s13369-017-2763-0 / rank
Normal rank
 
Property / author
 
Property / author: Jun-Fang Xiao / rank
Normal rank
 
Property / author
 
Property / author: Jun-Fang Xiao / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s13369-017-2763-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2741277671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for flow shop scheduling problems with machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with consecutive availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for two-machine flowshop scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for scheduling a two-machine flowshop with one unavailability interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical programming formulations for machine scheduling: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: MP or not MP: that is the question / rank
 
Normal rank
Property / cites work
 
Property / cites work: Book review of: A. Agnetis et al., Multiagent scheduling. Models and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative evaluation of MILP flowshop models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic optimization for the calculation of the time dependency of the physiological demand during exercise and recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem / 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: On ‘redundant’ constraints in Stafford's MILP model for the flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: New MILP models for the permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820362 / 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: An Improved Formulation for the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of integer programming formulations for scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization for two parallel machines scheduling with a periodic availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine scheduling with periodic availability constraints to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with tool changes to minimize total completion time: Basic results and SPT performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with tool changes to minimize total completion time under controllable machining conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S13369-017-2763-0 / rank
 
Normal rank

Latest revision as of 00:19, 11 December 2024

scientific article
Language Label Description Also known as
English
Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
scientific article

    Statements

    Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 June 2018
    0 references
    flow shop
    0 references
    availability constraint
    0 references
    makespan
    0 references
    mixed integer programming
    0 references
    0 references

    Identifiers