A product service supply chain (PSSC) supplies customers with product-service systems (PSS) consist of integrated products and services. The product manufacturing should match the service supply in the order delivery planning. For PSS orders are usually delivered under time window constraints, this paper is concerned with the integrated order acceptance and scheduling (OAS) decision of the PSSC. Defined the PSS orders by their revenues, product processing times, serving offering times and hard time window constraints, we formulate the OAS problem as a MILP model to optimize total revenue of PSSC and propose two effective value for big-M to solve the problem with small size optimally. The simulated annealing algorithm based on the priority rule of servable orders first (SOF-SA) and the dynamic acceptance and scheduling heuristic (DASH) algorithm are presented. The performance of the model and the two algorithms are proved through simulating instances with different order sizes. Computational tests show that the SOF-SA algorithm is more effective when used for small size problems while the DASH algorithm is more effective for problems with larger size; negotiating with customers to make reasonable delivery time windows should be beneficial to increasing total revenue and improving the decision efficiency.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.