SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN (Q3521606): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1656203
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ling-Fa Lu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with job delivery coordination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated Scheduling of Production and Distribution Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with batch deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: The coordination of scheduling and batch deliveries / 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: Machine scheduling with transportation considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with deliveries to multiple customer locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and distribution cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production and transport logistics scheduling with two transport mode choices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0217595908001596 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008936567 / rank
 
Normal rank

Latest revision as of 09:49, 30 July 2024

scientific article
Language Label Description Also known as
English
SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
scientific article

    Statements

    SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN (English)
    0 references
    0 references
    0 references
    26 August 2008
    0 references

    Identifiers