Single-machine due-window assignment problem with learning effect and deteriorating jobs
Ji-Bo Wang,Cheng Wang +1 more
Reads0
Chats0
TLDR
In this article, the authors considered a single-machine common due-window assignment scheduling problem with learning effect and deteriorating jobs and showed that the problem remains polynomially solvable under the proposed model.About:
This article is published in Applied Mathematical Modelling.The article was published on 2011-08-01 and is currently open access. It has received 78 citations till now. The article focuses on the topics: Job shop scheduling & Assignment problem.read more
Citations
More filters
Journal ArticleDOI
A survey on scheduling problems with due windows
TL;DR: A review of an extensive literature concerning problems with various models of given due windows, due window assignment andJob-independent and job-dependent earliness/tardiness penalties is presented, mentioning also their solution algorithms.
Journal ArticleDOI
Single-machine group scheduling with general deterioration and learning effects
Jing Bai,Zhi-Rong Li,Xue Huang +2 more
TL;DR: In this article, the authors consider single-machine group scheduling problems with effects of learning and deterioration at the same time and show that the problems remain solvable in polynomial time under the proposed model.
Journal ArticleDOI
Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation
TL;DR: In this article, a single-machine due-window assignment scheduling problem based on a common flow allowance is considered, where the actual processing time of a job is a function of its position in a sequence (learning effect) and its continuously divisible and non-renewable resource allocation.
Journal ArticleDOI
Scheduling problems with multiple due windows assignment and controllable processing times on a single machine
TL;DR: In this article, the problem of multiple due windows assignment scheduling and controllable processing times on a single machine was studied and shown to be polynomially solvable in O(n 3 ) time, where n is the total number of jobs.
Journal ArticleDOI
Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times
TL;DR: A single-machine common due-window assignment scheduling problem, in which the processing time of a job is a function of its position in a sequence and its resource allocation, is considered.
References
More filters
Book
Scheduling: Theory, Algorithms, and Systems
TL;DR: Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments and Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource.
Book ChapterDOI
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.
Journal ArticleDOI
Sequencing with Earliness and Tardiness Penalties: A Review
Kenneth R. Baker,Gary D. Scudder +1 more
TL;DR: A framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date is provided and such features as parallel machines, complex penalty functions and distinct due dates are added.
Journal ArticleDOI
Single-machine scheduling with learning considerations
TL;DR: It is shown in this paper that even with the introduction of learning to job processing times two important types of single-machine problems remain polynomially solvable.