Abstract
In many manufacturing or service industries, there exists maximum allowable tardiness for orders, according to purchase contracts between the customers and suppliers. Customers may cancel their orders and request compensation for damages, for breach of contract, when the delivery time is expected to exceed maximum allowable tardiness, whereas they may accept the delayed delivery of orders with a reasonable discount of price within maximum allowable tardiness. Although many research works have been produced on the job shop scheduling problem relating to minimizing total tardiness, none of them have yet considered problems with maximum allowable tardiness. In this study, we solve a job shop scheduling problem under maximum allowable tardiness, with the objective of minimizing tardiness penalty costs. Two kinds of penalty costs are considered, i.e., one for tardy jobs, and the other for canceled jobs. To deal with this problem within a reasonable time at actual production facilities, we propose several dispatching rules by extending well-known dispatching rules for the job shop scheduling problem, in cooperation with a probabilistic conception of those rules. To evaluate the proposed rules, computational experiments were carried out on 300 test instances. The test results show that the suggested probabilistic dispatching rules work better than the existing rules and the optimization solver CPLEX, with a time limit.
Highlights
In many manufacturing or service industries, customers may specify maximum allowable tardiness for their orders in purchase contracts, according to agreements with suppliers
We study the job shop scheduling problem (JSP)-maximum allowable tardiness (MAT) with the objective of minimizing the total penalty cost, where two kinds of penalty costs are considered, i.e., tardiness penalty costs for allowable tardy jobs, and lost-sale penalty costs for cancelled jobs
The proposed rules are an extended version of earliest due date (EDD), modified due date (MDD), SLACK, original cost over time (COVERT), and apparent tardiness cost (ATC), which are known to work well for the job shop tardiness scheduling problem, by considering lost-sale penalty costs as well as tardiness costs, in order to set the priority of jobs to be scheduled in a probabilistic manner
Summary
In many manufacturing or service industries, customers may specify maximum allowable tardiness for their orders in purchase contracts, according to agreements with suppliers. The electrical power consumption test and functional speed test consist of multiple routes, with sub-steps which are determined by the product types and the former test results Customers designate, both a normal shipping date, and a final shipping date (with late penalty) for the ordering contract. This production process can be modeled as a job shop with maximum allowable tardiness (MAT). Existing dispatching rules have a limitation in improving the performance of job shop operations, because fixed priorities, determined by a certain dispatching rule, are assigned to all operations so that they offer the same solution for the same problem To overcome these limitations, we developed probabilistic dispatching rules to solve the JSP-MAT, with the objective of minimizing the total penalty cost. The proposed rules are an extended version of earliest due date (EDD), modified due date (MDD), SLACK, original cost over time (COVERT), and apparent tardiness cost (ATC), which are known to work well for the job shop tardiness scheduling problem, by considering lost-sale penalty costs as well as tardiness costs, in order to set the priority of jobs to be scheduled in a probabilistic manner
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
