Header menu link for other important links
X
Order acceptance and scheduling in a parallel machine environment with weighted completion time
Published in Inderscience Enterprises Ltd.
2018
Volume: 12
   
Issue: 4
Pages: 535 - 557
Abstract
This paper studies the order acceptance and scheduling (OAS) problem in an identical parallel machine environment where orders are characterised by their revenues, processing times and weights. A mixed integer linear programming (MILP) model is presented for the problem with the objective of maximising the revenue minus the scheduling cost. The problem is NP- hard and a branch and bound (B&B) algorithm is developed to solve the problem. An extension of the B&B algorithm is proposed to solve very large problem instances to obtain ∈-optimal solutions. The B&B algorithm and the extended B&B are evaluated for their performances against the solutions obtained by solving the MILP problem formulation using CPLEX solver through computational experiments. Copyright © 2018 Inderscience Enterprises Ltd.
About the journal
JournalEuropean Journal of Industrial Engineering
PublisherInderscience Enterprises Ltd.
ISSN17515254
Open AccessNo
Concepts (12)
  •  related image
    Branch and bound method
  •  related image
    Integer programming
  •  related image
    Scheduling
  •  related image
    Branch-and-bound algorithms
  •  related image
    Computational experiment
  •  related image
    IDENTICAL PARALLEL MACHINES
  •  related image
    Mixed integer linear programming model
  •  related image
    ORDER ACCEPTANCE
  •  related image
    PARALLEL MACHINE
  •  related image
    Problem formulation
  •  related image
    WEIGHTED COMPLETION TIME
  •  related image
    Problem solving