Order scheduling in an environment with dedicated resources in parallel

DOI10.1007/S10951-005-2860-XzbMath1123.90030OpenAlexW2015082608MaRDI QIDQ880508

Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-005-2860-x

zbMATH Keywords

approximationNP-hardtotal completion timeTabu Searchorder scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (26)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time ⋮ Minimizing maximum delivery completion time for order scheduling with rejection ⋮ The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic ⋮ New approximate algorithms for the customer order scheduling problem with total completion time objective ⋮ An order scheduling problem with position-based learning effect ⋮ The representation of partially-concurrent open shop problems ⋮ Customer order scheduling on a single machine with family setup times: complexity and algorithms ⋮ A note on the complexity of the concurrent open shop problem ⋮ Scheduling orders for multiple product types to minimize total weighted completion time ⋮ Integrated production and transportation scheduling with order-dependent inventory holding costs ⋮ A learning-based two-stage optimization method for customer order scheduling ⋮ Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ Minimizing the sum of weighted completion times in a concurrent open shop ⋮ Minimizing the total weighted completion time of fully parallel jobs with integer parallel units ⋮ Cost-sharing mechanisms for scheduling under general demand settings ⋮ Scheduling Fully Parallel Jobs with Integer Parallel Units ⋮ Metaheuristics for order scheduling problem with unequal ready times ⋮ Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms ⋮ Scheduling with centralized and decentralized batching policies in concurrent open shops ⋮ Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time ⋮ Order scheduling with tardiness objective: improved approximate solutions ⋮ Tailoring customer order scheduling search algorithms ⋮ Preemptive multiprocessor order scheduling to minimize total weighted flowtime ⋮ Scheduling fully parallel jobs ⋮ Scheduling orders for multiple product types with due date related objectives

Uses Software

• Tabu search

Cites Work

• Open shops with jobs overlap -- revisited
• Open shops with jobs overlap
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Unnamed Item
• Unnamed Item

This page was built for publication: Order scheduling in an environment with dedicated resources in parallel