Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...

preventive maintenance scheduling of generating units is addressed as a long-term scheduling in power system studies aiming to increase the reliability incorporating cost reduction. it consists of knowing which generating units should be shut down for regular safety inspection. in this paper, a new formulation of preventive maintenance scheduling associated with cost reduction index (cri) is pr...

in a supply chain, cross-docking is one of the most innovative systems for ameliorating the operational performance at distribution centers. cross-docking is a logistics strategy in which freight is unloaded from inbound trucks and (almost) directly loaded into outbound trucks, with little or no storage in between, thus no inventory remains at the distribution center. in this paper, we consider...

in this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. single supplier via a flexible flow line production system (ffl) produces several items and delivers them directly to an assembly facility. based on basic period (bp) strategy, a new mixed zero-one nonlinear programming model has been develope...

although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...