PENGEMBANGAN ALGORITMA PENJADUALAN PRODUKSI JOB SHOP UNTUK MEMINIMUMKAN TOTAL BIAYA EARLINESS DAN TARDINESS

PENGEMBANGAN ALGORITMA PENJADUALAN PRODUKSI JOB SHOP UNTUK MEMINIMUMKAN TOTAL BIAYA EARLINESS DAN TARDINESS

Dewi, Dian Retno Sari;
jurnal ilmiah teknik industri 2005 Vol. 4 pp. 57-65
206
dewi2005pengembanganjurnal

Abstract

This paper develops job shop production scheduling using Non Delay algorithm through forward and backward-forward algorithm to minimize total earliness and tardiness costs. Backward approach has some disadvantages, such as, if the job is scheduled in backward, there is a possibility that the infeasible situation occurs, in which the job is scheduled at t<0. This paper used hypothetic data generated randomly. This job shop scheduling algorithm development was validated using LINDO software to check the effectiveness heuristic method, compared with the optimation method. The validation proves that the result of backward-forward scheduling method is better than the result of forward scheduling method.

Citation

ID: 24128
Ref Key: dewi2005pengembanganjurnal
Use this key to autocite in SciMatic or Thesis Manager

References

Blockchain Verification

Account:
NFT Contract Address:
0x95644003c57E6F55A65596E3D9Eac6813e3566dA
Article ID:
24128
Unique Identifier:
43a9c97c9a7b86a820e9c455f6ef8404
Network:
Scimatic Chain (ID: 481)
Loading...
Blockchain Readiness Checklist
Authors
Abstract
Journal Name
Year
Title
5/5
Creates 1,000,000 NFT tokens for this article
Token Features:
  • ERC-1155 Standard NFT
  • 1 Million Supply per Article
  • Transferable via MetaMask
  • Permanent Blockchain Record
Blockchain QR Code
Scan with Saymatik Web3.0 Wallet

Saymatik Web3.0 Wallet