Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.

DOI10.1016/S0305-0548(02)00118-1zbMath1047.90023OpenAlexW2164164717MaRDI QIDQ1413824

Daecheol Kim, José A. Ventura

Publication date: 17 November 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00118-1

zbMATH Keywords

Lagrangian relaxationParallel machine schedulingEarliness--tardiness penaltiesResource constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (14)

Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ Algorithms for the unrelated parallel machine scheduling problem with a resource constraint ⋮ Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost ⋮ Mixed Integer Linear Programming for a Real-World Parallel Machine Scheduling Problem with Workforce and Precedence Constraints ⋮ Restricted assignment scheduling with resource constraints ⋮ Heuristic methods for the single-machine scheduling problem with periodical resource constraints ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates ⋮ Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem ⋮ Parallel machine scheduling with tool loading ⋮ A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates ⋮ Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment ⋮ Production, maintenance and resource scheduling: a review ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods

Cites Work

• Scheduling tasks on two processors with deadlines and additional resources
• Minimizing mean flow time with parallel processors and resource constraints
• New trends in machine scheduling
• Two parallel machine sequencing problems involving controllable job processing times
• Performance of scheduling algorithms for no-wait flowshops with parallel machines
• Sequencing with Earliness and Tardiness Penalties: A Review
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• On convergence rates of subgradient optimization methods
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Minimization of Total Absolute Flow Time Deviation in Single and Multiple Machine Scheduling
• Validation of subgradient optimization
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.