Optimal due-date assignment in a job shop†
From MaRDI portal
Publication:3712114
DOI10.1080/00207548608919746zbMath0585.90048OpenAlexW2126397430MaRDI QIDQ3712114
Publication date: 1986
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207548608919746
due-date assignmentdynamic job shopassumptions on queue discipline and processing time distributionoptimal processing time
Related Items
Optimal total-work-content-power due-date determination and sequencing, An algorithm for the CON due-date determination and sequencing problem, Optimal common due-date with limited completion time deviation, A survey of priority rule-based scheduling, Survey of scheduling research involving due date determination decisions, Single machine scheduling with common due data assignment in a group technology environment, Common due-date determination and sequencing using tabu search, Determination of an optimal common due date and optimal sequence in a single machine job shop, Optimal due-date assignment and sequencing in a single machine shop, Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine, Optimal due-date assignment and sequencing, A dynamic job shop scheduling framework: a backward approach, A dynamic forecasting model for job shop flowtime prediction and tardiness control, Real-time due-date promising by build-to-order environments, Lead time selection and the behaviour of work flow in job shops, Single-machine scheduling to minimize earliness and number of tardy jobs, Pricing and lead time decisions for make-to-order firms with contingent orders
Cites Work
