CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
On analysis of input data for jobs shop scheduling problem with respect to workers productivity
Authors
Belov V.
Khadiev K.
Makarychev K.
Publication date
1 January 2016
Publisher
Abstract
© 2016,International Journal of Pharmacy and Technology. All rights reserved.We explore one kind of Job shop scheduling problem,where productivity of workers depends on previous behavior. We consider two parts in “working day”: working period and time-off period. Worker increase their efficient on working period and time-off period. Playing with schedule give us different productivity for workers. We consider big input data,which size does not allow use brute-force search or back-tracking algorithm. It means we should use a heuristic solutions. We suggest linear-time solution which works for specific input data structure. We analyze the input and describe the conditions which allow to apply our solution. Considered conditions was following: length of periods,number of jobs,number of “small” and “big” jobs,speed of productivity increasing and decreasing,number of workers,minimal and maximal productivity and others. We compare our solutions with greedy algorithmic solution,which just assign free worker to first available job,and we have benefit about 15 percents with respect to that greedy algorithmic solution
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Kazan Federal University Digital Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dspace.kpfu.ru:net/145660
Last time updated on 07/05/2019