Worst-Case Analysis of Cash Inventory in Single Machine Scheduling

Document Type : Article

Authors

1 Department of Industrial Engineering, Faculty of Engineering, Arak University, Arak, Iran

2 bClothing Engineering and Management Group, Department of Textile Engineering, Amirkabir University of Technology, Tehran, Iran

Abstract

This paper studies the inventory of cash as a renewable resource in single machine scheduling problem. The status of cash is incorporated in to the objective function. Average and minimum available cash and maximum and average cash deficiency are contemplated subject to a worst-case scenario that for each job the cost [price] is paid [received] entirely at the start [end] of processing the job. For each objective, either proof of NP-Hardness or optimal scheduling rule are provided. Some scenario-based numerical experiments are also carried out which reveal and emphasize the effect of financial assumptions of this research in single machine scheduling.

Keywords

Scientia Iranica

Articles in Press, Accepted Manuscript
Available Online from 28 November 2022

Files

Share

How to cite

Statistics