Parallel machine selection and job scheduling to minimize machine cost and job tardiness

DOI10.1016/j.cor.2004.01.001zbMath1068.90054OpenAlexW2086111473MaRDI QIDQ2387248

Guohua Wan, Mingyuan Chen, Dong Cao

Publication date: 2 September 2005

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

Full work available at URL: https://doi.org/10.1016/j.cor.2004.01.001

zbMATH Keywords

Tabu searchOptimizationParallel machine schedulingMachine selection

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35)

Related Items (15)

Bicriteria scheduling problem for unrelated parallel machines with release dates ⋮ Acquisition planning and scheduling of computing resources ⋮ Scheduling parallel CNC machines with time/cost trade-off considerations ⋮ Batching deteriorating items with applications in computer communication and reverse logistics ⋮ Online algorithms for scheduling with machine activation cost on two uniform machines ⋮ The optimal number of used machines in a two-stage flexible flowshop scheduling problem ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem ⋮ Batch scheduling in a two-stage flexible flow shop problem ⋮ Uniform parallel machine scheduling problems with fixed machine cost ⋮ Scheduling unrelated parallel machines with optional machines and jobs selection ⋮ Scheduling with variable time slot costs ⋮ Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs ⋮ Scheduling games on uniform machines with activation cost ⋮ ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST

Uses Software

• LINDO
• LINGO
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel machine scheduling with earliness and tardiness penalties
• Scheduling parallel machines to minimize total weighted and unweighted tardiness
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• A tabu search algorithm for parallel machine total tardiness problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Sequencing with Earliness and Tardiness Penalties: A Review
• Tabu Search—Part I
• Tabu Search—Part II
• Parallel flowshop scheduling using Tabu search
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• The Total Tardiness Problem: Review and Extensions
• Defining tabu list size and aspiration criterion within tabu search methods

This page was built for publication: Parallel machine selection and job scheduling to minimize machine cost and job tardiness