Sequencing with earliness and tardiness penalties: a review
Operations Research
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Job shop scheduling by simulated annealing
Operations Research
A branch and bound algorithm for the job-shop scheduling problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Genetic algorithm crossover operators for ordering applications
Computers and Operations Research - Special issue on genetic algorithms
A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation
Computers and Industrial Engineering
Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
Mathematics of Operations Research
Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints
Computers and Operations Research
A hybrid genetic algorithm for the job shop scheduling problems
Computers and Industrial Engineering
Evolutionary Scheduling: A Review
Genetic Programming and Evolvable Machines
Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
Computers and Industrial Engineering
An Improved Augmented Neural-Network Approach for Scheduling Problems
INFORMS Journal on Computing
Mathematical and Computer Modelling: An International Journal
Genetic optimization of order scheduling with multiple uncertainties
Expert Systems with Applications: An International Journal
A GA methodology for the scheduling of yarn-dyed textile production
Expert Systems with Applications: An International Journal
An evolutionary algorithm for assembly job shop with part sharing
Computers and Industrial Engineering
A resource-constrained assembly job shop scheduling problem with Lot Streaming technique
Computers and Industrial Engineering
Short Communication: An effective TPA-based algorithm for job-shop scheduling problem
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
An adaptive annealing genetic algorithm for the job-shop planning and scheduling problem
Expert Systems with Applications: An International Journal
Mathematical models for preemptive shop scheduling problems
Computers and Operations Research
Assembly line balancing in garment industry
Expert Systems with Applications: An International Journal
A RFID-based Resource Allocation System for garment manufacturing
Expert Systems with Applications: An International Journal
An optimal method for the preemptive job shop scheduling problem
Computers and Operations Research
Hi-index | 0.01 |
An effective job shop scheduling (JSS) in the manufacturing industry is helpful to meet the production demand and reduce the production cost, and to improve the ability to compete in the ever increasing volatile market demanding multiple products. In this paper, a universal mathematical model of the JSS problem for apparel assembly process is constructed. The objective of this model is to minimize the total penalties of earliness and tardiness by deciding when to start each order's production and how to assign the operations to machines (operators). A genetic optimization process is then presented to solve this model, in which a new chromosome representation, a heuristic initialization process and modified crossover and mutation operators are proposed. Three experiments using industrial data are illustrated to evaluate the performance of the proposed method. The experimental results demonstrate the effectiveness of the proposed algorithm to solve the JSS problem in a mixed- and multi-product assembly environment.