Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness (Q319136): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6633434 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
assignment problems
Property / zbMATH Keywords: assignment problems / rank
 
Normal rank
Property / zbMATH Keywords
 
branch and bound
Property / zbMATH Keywords: branch and bound / rank
 
Normal rank
Property / zbMATH Keywords
 
metaheuristics
Property / zbMATH Keywords: metaheuristics / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed delivery dates
Property / zbMATH Keywords: fixed delivery dates / 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.1016/j.ejor.2014.12.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029241815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for parallel machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated Production and Outbound Distribution Scheduling: Review and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinated scheduling of production and delivery with production window and delivery capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Fixed Delivery Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated production and distribution with fixed delivery departure dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unrelated parallel machines to minimize total weighted tardiness. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Weighted Total Tardiness Problem with Fixed Shipping Times and Overtime Utilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with delivery dates and cumulative payoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total tardiness in an unrelated parallel-machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on parallel identical machines to minimize total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing the processing of incoming mail to match an outbound truck delivery schedule / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 15:36, 12 July 2024

scientific article
Language Label Description Also known as
English
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
scientific article

    Statements

    Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness (English)
    0 references
    0 references
    0 references
    0 references
    6 October 2016
    0 references
    scheduling
    0 references
    assignment problems
    0 references
    branch and bound
    0 references
    metaheuristics
    0 references
    fixed delivery dates
    0 references

    Identifiers