Integrated order acceptance and scheduling decision making in product service supply chain with hard time windows constraints
DOI10.3934/jimo.2017041zbMath1412.49052OpenAlexW2607363113MaRDI QIDQ1716935
Bin Dan, Songxuan Ma, Yang Zhang, Huali Gao, Ru Liu
Publication date: 5 February 2019
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2017041
simulated annealing algorithmhard time windowsorder acceptance and schedulingproduct service supply chainproduct-service systems
Mixed integer programming (90C11) Optimality conditions for minimax problems (49K35) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)
Related Items (2)
Cites Work
- Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
- Modeling and optimization of a product-service system with additional service capacity and impatient customers
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
- Production scheduling and vehicle routing with time windows for perishable food products
- Single machine scheduling with release dates and rejection
- Integrated machine scheduling and vehicle routing with time windows
- Order acceptance and scheduling with machine availability constraints
- Single-machine scheduling and due date assignment with rejection and position-dependent processing times
- Scheduling on parallel machines to minimise maximum lateness for the customer order problem
This page was built for publication: Integrated order acceptance and scheduling decision making in product service supply chain with hard time windows constraints
